* installing *source* package ‘rgeoda’ ...
** this is package ‘rgeoda’ version ‘0.1.0’
** package ‘rgeoda’ 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)’
using C++17
make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/rgeoda/src'
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/libgeoda.cpp -o libgeoda/libgeoda.o
In file included from libgeoda/libgeoda.cpp:14:
libgeoda/./shape/centroid.h: In static member function ‘static bool Orientation::isCCW(const std::vector<gda::Point>&, int, int)’:
libgeoda/./shape/centroid.h:155:48: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare]
  155 |         while(pts[iPrev].equals(hiPt) && iPrev != hiIndex);
      |                                          ~~~~~~^~~~~~~~~~
In file included from libgeoda/./shape/ttmath/ttmathint.h:48,
                 from libgeoda/./shape/ttmath/ttmathbig.h:46,
                 from libgeoda/./shape/ttmath/ttmath.h:58,
                 from libgeoda/./shape/centroid.h:14:
libgeoda/./shape/ttmath/ttmathuint.h: In instantiation of ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 2; long long unsigned int second_size = 1; long long unsigned int result_size = 4; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’:
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1247:23:   required from ‘void ttmath::UInt<value_size>::Mul3Big(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]’
 1247 |                 Mul3Big2<value_size>(table, ss2.table, result.table);
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:966:4:   required from ‘void ttmath::UInt<value_size>::MulBig(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&, ttmath::uint) [with long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
  966 |                         Mul3Big(ss2, result);
      |                         ^~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1306:18:   required from ‘ttmath::uint ttmath::Big<exp, man>::MulRef(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1306 |                 mantissa.MulBig(ss2.mantissa, man_result);
      |                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1360:11:   required from ‘ttmath::uint ttmath::Big<exp, man>::Mul(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1360 |                         return MulRef(copy_ss2, round);
      |                                ^~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:5639:8:   required from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator*(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’
 5639 |                 temp.Mul(ss2);
      |                 ~~~~~^~~
libgeoda/./shape/centroid.h:122:24:   required from here
  122 |         DD mx1y2(dx1 * dy2);
      |                        ^~~
libgeoda/./shape/ttmath/ttmathuint.h:1350:17: warning: variable ‘c’ set but not used [-Wunused-but-set-variable]
 1350 |         uint i, c, xc, yc;
      |                 ^
libgeoda/./shape/ttmath/ttmathuint.h: In instantiation of ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 1; long long unsigned int second_size = 1; long long unsigned int result_size = 4; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’:
libgeoda/./shape/ttmath/ttmathuint.h:1314:45:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1314 |                         Mul3Big3<ss_size/2, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1247:23:   required from ‘void ttmath::UInt<value_size>::Mul3Big(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]’
 1247 |                 Mul3Big2<value_size>(table, ss2.table, result.table);
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:966:4:   required from ‘void ttmath::UInt<value_size>::MulBig(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&, ttmath::uint) [with long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
  966 |                         Mul3Big(ss2, result);
      |                         ^~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1306:18:   required from ‘ttmath::uint ttmath::Big<exp, man>::MulRef(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1306 |                 mantissa.MulBig(ss2.mantissa, man_result);
      |                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1360:11:   required from ‘ttmath::uint ttmath::Big<exp, man>::Mul(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1360 |                         return MulRef(copy_ss2, round);
      |                                ^~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:5639:8:   required from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator*(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’
 5639 |                 temp.Mul(ss2);
      |                 ~~~~~^~~
libgeoda/./shape/centroid.h:122:24:   required from here
  122 |         DD mx1y2(dx1 * dy2);
      |                        ^~~
libgeoda/./shape/ttmath/ttmathuint.h:1350:17: warning: variable ‘c’ set but not used [-Wunused-but-set-variable]
 1350 |         uint i, c, xc, yc;
      |                 ^
libgeoda/./shape/ttmath/ttmathuint.h: In instantiation of ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 1; long long unsigned int second_size = 0; long long unsigned int result_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’:
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 1; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1357:24:   required from ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 2; long long unsigned int second_size = 1; long long unsigned int result_size = 4; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1357 |                 Mul3Big2<second_size>(x1, y1, result+first_size*2);    // z2
      |                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1247:23:   required from ‘void ttmath::UInt<value_size>::Mul3Big(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]’
 1247 |                 Mul3Big2<value_size>(table, ss2.table, result.table);
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:966:4:   required from ‘void ttmath::UInt<value_size>::MulBig(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&, ttmath::uint) [with long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
  966 |                         Mul3Big(ss2, result);
      |                         ^~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1306:18:   required from ‘ttmath::uint ttmath::Big<exp, man>::MulRef(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1306 |                 mantissa.MulBig(ss2.mantissa, man_result);
      |                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1360:11:   required from ‘ttmath::uint ttmath::Big<exp, man>::Mul(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1360 |                         return MulRef(copy_ss2, round);
      |                                ^~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:5639:8:   required from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator*(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’
 5639 |                 temp.Mul(ss2);
      |                 ~~~~~^~~
libgeoda/./shape/centroid.h:122:24:   required from here
  122 |         DD mx1y2(dx1 * dy2);
      |                        ^~~
libgeoda/./shape/ttmath/ttmathuint.h:1350:17: warning: variable ‘c’ set but not used [-Wunused-but-set-variable]
 1350 |         uint i, c, xc, yc;
      |                 ^
libgeoda/./shape/ttmath/ttmathuint.h: In instantiation of ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 0; long long unsigned int second_size = 0; long long unsigned int result_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’:
libgeoda/./shape/ttmath/ttmathuint.h:1314:45:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 1; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1314 |                         Mul3Big3<ss_size/2, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1357:24:   required from ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 2; long long unsigned int second_size = 1; long long unsigned int result_size = 4; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1357 |                 Mul3Big2<second_size>(x1, y1, result+first_size*2);    // z2
      |                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1247:23:   required from ‘void ttmath::UInt<value_size>::Mul3Big(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]’
 1247 |                 Mul3Big2<value_size>(table, ss2.table, result.table);
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:966:4:   required from ‘void ttmath::UInt<value_size>::MulBig(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&, ttmath::uint) [with long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
  966 |                         Mul3Big(ss2, result);
      |                         ^~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1306:18:   required from ‘ttmath::uint ttmath::Big<exp, man>::MulRef(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1306 |                 mantissa.MulBig(ss2.mantissa, man_result);
      |                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1360:11:   required from ‘ttmath::uint ttmath::Big<exp, man>::Mul(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1360 |                         return MulRef(copy_ss2, round);
      |                                ^~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:5639:8:   required from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator*(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’
 5639 |                 temp.Mul(ss2);
      |                 ~~~~~^~~
libgeoda/./shape/centroid.h:122:24:   required from here
  122 |         DD mx1y2(dx1 * dy2);
      |                        ^~~
libgeoda/./shape/ttmath/ttmathuint.h:1350:17: warning: variable ‘c’ set but not used [-Wunused-but-set-variable]
 1350 |         uint i, c, xc, yc;
      |                 ^
libgeoda/./shape/ttmath/ttmathuint.h: In instantiation of ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 1; long long unsigned int second_size = 0; long long unsigned int result_size = 0; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’:
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 0; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1357:24:   required from ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 1; long long unsigned int second_size = 0; long long unsigned int result_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1357 |                 Mul3Big2<second_size>(x1, y1, result+first_size*2);    // z2
      |                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 1; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1357:24:   required from ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 2; long long unsigned int second_size = 1; long long unsigned int result_size = 4; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1357 |                 Mul3Big2<second_size>(x1, y1, result+first_size*2);    // z2
      |                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1247:23:   required from ‘void ttmath::UInt<value_size>::Mul3Big(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]’
 1247 |                 Mul3Big2<value_size>(table, ss2.table, result.table);
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:966:4:   required from ‘void ttmath::UInt<value_size>::MulBig(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&, ttmath::uint) [with long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
  966 |                         Mul3Big(ss2, result);
      |                         ^~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1306:18:   required from ‘ttmath::uint ttmath::Big<exp, man>::MulRef(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1306 |                 mantissa.MulBig(ss2.mantissa, man_result);
      |                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1360:11:   required from ‘ttmath::uint ttmath::Big<exp, man>::Mul(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1360 |                         return MulRef(copy_ss2, round);
      |                                ^~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:5639:8:   required from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator*(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’
 5639 |                 temp.Mul(ss2);
      |                 ~~~~~^~~
libgeoda/./shape/centroid.h:122:24:   required from here
  122 |         DD mx1y2(dx1 * dy2);
      |                        ^~~
libgeoda/./shape/ttmath/ttmathuint.h:1350:17: warning: variable ‘c’ set but not used [-Wunused-but-set-variable]
 1350 |         uint i, c, xc, yc;
      |                 ^
libgeoda/./shape/ttmath/ttmathuint.h: In instantiation of ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 0; long long unsigned int second_size = 0; long long unsigned int result_size = 0; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’:
libgeoda/./shape/ttmath/ttmathuint.h:1314:45:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 0; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1314 |                         Mul3Big3<ss_size/2, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1357:24:   required from ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 1; long long unsigned int second_size = 0; long long unsigned int result_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1357 |                 Mul3Big2<second_size>(x1, y1, result+first_size*2);    // z2
      |                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 1; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1357:24:   required from ‘void ttmath::UInt<value_size>::Mul3Big3(const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int first_size = 2; long long unsigned int second_size = 1; long long unsigned int result_size = 4; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1357 |                 Mul3Big2<second_size>(x1, y1, result+first_size*2);    // z2
      |                 ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1303:49:   required from ‘void ttmath::UInt<value_size>::Mul3Big2(const ttmath::uint*, const ttmath::uint*, ttmath::uint*) [with long long unsigned int ss_size = 2; long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
 1303 |                         Mul3Big3<ss_size/2 + 1, ss_size/2, ss_size*2>(x1, x0, y1, y0, result);
      |                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:1247:23:   required from ‘void ttmath::UInt<value_size>::Mul3Big(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]’
 1247 |                 Mul3Big2<value_size>(table, ss2.table, result.table);
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathuint.h:966:4:   required from ‘void ttmath::UInt<value_size>::MulBig(const ttmath::UInt<value_size>&, ttmath::UInt<(value_size * 2)>&, ttmath::uint) [with long long unsigned int value_size = 2; ttmath::uint = long long unsigned int]’
  966 |                         Mul3Big(ss2, result);
      |                         ^~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1306:18:   required from ‘ttmath::uint ttmath::Big<exp, man>::MulRef(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1306 |                 mantissa.MulBig(ss2.mantissa, man_result);
      |                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:1360:11:   required from ‘ttmath::uint ttmath::Big<exp, man>::Mul(const ttmath::Big<exp, man>&, bool) [with long long unsigned int exp = 1; long long unsigned int man = 2; ttmath::uint = long long unsigned int]’
 1360 |                         return MulRef(copy_ss2, round);
      |                                ^~~~~~
libgeoda/./shape/ttmath/ttmathbig.h:5639:8:   required from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator*(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’
 5639 |                 temp.Mul(ss2);
      |                 ~~~~~^~~
libgeoda/./shape/centroid.h:122:24:   required from here
  122 |         DD mx1y2(dx1 * dy2);
      |                        ^~~
libgeoda/./shape/ttmath/ttmathuint.h:1350:17: warning: variable ‘c’ set but not used [-Wunused-but-set-variable]
 1350 |         uint i, c, xc, yc;
      |                 ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:116:37:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:116:37: note: ‘<anonymous>’ declared here
  116 |         DD dx1 = DD(p2.x) + DD(-p1.x);
      |                                     ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:116:25:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:116:25: note: ‘<anonymous>’ declared here
  116 |         DD dx1 = DD(p2.x) + DD(-p1.x);
      |                         ^
In member function ‘ttmath::uint ttmath::Int<value_size>::FromUIntOrInt(const ttmath::UInt<result_size>&, bool) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’,
    inlined from ‘ttmath::uint ttmath::Int<value_size>::FromInt(const ttmath::Int<argument_size>&) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:699:23,
    inlined from ‘ttmath::Int<value_size>& ttmath::Int<value_size>::operator=(const ttmath::Int<value_size>&) [with long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:773:10,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3670:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:116:37:
libgeoda/./shape/ttmath/ttmathint.h:653:61: warning: ‘<unnamed>.ttmath::Big<1, 2>::exponent.ttmath::Int<1>::<unnamed>.ttmath::UInt<1>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
  653 |                         UInt<value_size>::table[i] = p.table[i];
      |                                                      ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:116:25: note: ‘<anonymous>’ declared here
  116 |         DD dx1 = DD(p2.x) + DD(-p1.x);
      |                         ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:116:37:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:116:25: note: ‘<anonymous>’ declared here
  116 |         DD dx1 = DD(p2.x) + DD(-p1.x);
      |                         ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:116:37:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[1]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:116:25: note: ‘<anonymous>’ declared here
  116 |         DD dx1 = DD(p2.x) + DD(-p1.x);
      |                         ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:117:37:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:117:37: note: ‘<anonymous>’ declared here
  117 |         DD dy1 = DD(p2.y) + DD(-p1.y);
      |                                     ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:117:25:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:117:25: note: ‘<anonymous>’ declared here
  117 |         DD dy1 = DD(p2.y) + DD(-p1.y);
      |                         ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:117:37:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:117:25: note: ‘<anonymous>’ declared here
  117 |         DD dy1 = DD(p2.y) + DD(-p1.y);
      |                         ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:117:37:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[1]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:117:25: note: ‘<anonymous>’ declared here
  117 |         DD dy1 = DD(p2.y) + DD(-p1.y);
      |                         ^
In member function ‘ttmath::uint ttmath::Int<value_size>::FromUIntOrInt(const ttmath::UInt<result_size>&, bool) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’,
    inlined from ‘ttmath::uint ttmath::Int<value_size>::FromInt(const ttmath::Int<argument_size>&) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:699:23,
    inlined from ‘ttmath::Int<value_size>& ttmath::Int<value_size>::operator=(const ttmath::Int<value_size>&) [with long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:773:10,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3670:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:117:37:
libgeoda/./shape/ttmath/ttmathint.h:653:61: warning: ‘<unnamed>.ttmath::Big<1, 2>::exponent.ttmath::Int<1>::<unnamed>.ttmath::UInt<1>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
  653 |                         UInt<value_size>::table[i] = p.table[i];
      |                                                      ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:117:25: note: ‘<anonymous>’ declared here
  117 |         DD dy1 = DD(p2.y) + DD(-p1.y);
      |                         ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:118:36:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:118:36: note: ‘<anonymous>’ declared here
  118 |         DD dx2 = DD(q.x) + DD(-p2.x);
      |                                    ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:118:24:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:118:24: note: ‘<anonymous>’ declared here
  118 |         DD dx2 = DD(q.x) + DD(-p2.x);
      |                        ^
In member function ‘ttmath::uint ttmath::Int<value_size>::FromUIntOrInt(const ttmath::UInt<result_size>&, bool) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’,
    inlined from ‘ttmath::uint ttmath::Int<value_size>::FromInt(const ttmath::Int<argument_size>&) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:699:23,
    inlined from ‘ttmath::Int<value_size>& ttmath::Int<value_size>::operator=(const ttmath::Int<value_size>&) [with long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:773:10,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3670:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:118:36:
libgeoda/./shape/ttmath/ttmathint.h:653:61: warning: ‘<unnamed>.ttmath::Big<1, 2>::exponent.ttmath::Int<1>::<unnamed>.ttmath::UInt<1>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
  653 |                         UInt<value_size>::table[i] = p.table[i];
      |                                                      ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:118:24: note: ‘<anonymous>’ declared here
  118 |         DD dx2 = DD(q.x) + DD(-p2.x);
      |                        ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:118:36:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[1]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:118:24: note: ‘<anonymous>’ declared here
  118 |         DD dx2 = DD(q.x) + DD(-p2.x);
      |                        ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:118:36:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:118:24: note: ‘<anonymous>’ declared here
  118 |         DD dx2 = DD(q.x) + DD(-p2.x);
      |                        ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:119:36:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:119:36: note: ‘<anonymous>’ declared here
  119 |         DD dy2 = DD(q.y) + DD(-p2.y);
      |                                    ^
In member function ‘void ttmath::Big<exp, man>::SetInfoBit(unsigned char) [with long long unsigned int exp = 1; long long unsigned int man = 2]’,
    inlined from ‘void ttmath::Big<exp, man>::SetNan() [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:298:13,
    inlined from ‘ttmath::uint ttmath::Big<exp, man>::FromDouble(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:2743:10,
    inlined from ‘ttmath::Big<exp, man>::Big(double) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3164:13,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:119:24:
libgeoda/./shape/ttmath/ttmathbig.h:238:24: warning: ‘<anonymous>.ttmath::Big<1, 2>::info’ may be used uninitialized [-Wmaybe-uninitialized]
  238 |                 info = info | bit;
      |                        ^~~~
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:119:24: note: ‘<anonymous>’ declared here
  119 |         DD dy2 = DD(q.y) + DD(-p2.y);
      |                        ^
In member function ‘ttmath::uint ttmath::Int<value_size>::FromUIntOrInt(const ttmath::UInt<result_size>&, bool) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’,
    inlined from ‘ttmath::uint ttmath::Int<value_size>::FromInt(const ttmath::Int<argument_size>&) [with long long unsigned int argument_size = 1; long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:699:23,
    inlined from ‘ttmath::Int<value_size>& ttmath::Int<value_size>::operator=(const ttmath::Int<value_size>&) [with long long unsigned int value_size = 1]’ at libgeoda/./shape/ttmath/ttmathint.h:773:10,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3670:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:119:36:
libgeoda/./shape/ttmath/ttmathint.h:653:61: warning: ‘<unnamed>.ttmath::Big<1, 2>::exponent.ttmath::Int<1>::<unnamed>.ttmath::UInt<1>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
  653 |                         UInt<value_size>::table[i] = p.table[i];
      |                                                      ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:119:24: note: ‘<anonymous>’ declared here
  119 |         DD dy2 = DD(q.y) + DD(-p2.y);
      |                        ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:119:36:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[1]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:119:24: note: ‘<anonymous>’ declared here
  119 |         DD dy2 = DD(q.y) + DD(-p2.y);
      |                        ^
In member function ‘ttmath::UInt<value_size>& ttmath::UInt<value_size>::operator=(const ttmath::UInt<value_size>&) [with long long unsigned int value_size = 2]’,
    inlined from ‘ttmath::Big<exp, man>& ttmath::Big<exp, man>::operator=(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3671:12,
    inlined from ‘ttmath::Big<exp, man>::Big(const ttmath::Big<exp, man>&) [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:3683:12,
    inlined from ‘ttmath::Big<exp, man> ttmath::Big<exp, man>::operator+(const ttmath::Big<exp, man>&) const [with long long unsigned int exp = 1; long long unsigned int man = 2]’ at libgeoda/./shape/ttmath/ttmathbig.h:5619:15,
    inlined from ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’ at libgeoda/./shape/centroid.h:119:36:
libgeoda/./shape/ttmath/ttmathuint.h:2765:43: warning: ‘<unnamed>.ttmath::Big<1, 2>::mantissa.ttmath::UInt<2>::table[0]’ may be used uninitialized [-Wmaybe-uninitialized]
 2765 |                         table[i] = p.table[i];
      |                                    ~~~~~~~^
libgeoda/./shape/centroid.h: In static member function ‘static int Orientation::index(const gda::Point&, const gda::Point&, const gda::Point&)’:
libgeoda/./shape/centroid.h:119:24: note: ‘<anonymous>’ declared here
  119 |         DD dy2 = DD(q.y) + DD(-p2.y);
      |                        ^
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/gda_sa.cpp -o libgeoda/gda_sa.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/gda_sa.cpp:3:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/gda_data.cpp -o libgeoda/gda_data.o
In file included from libgeoda/gda_sa.cpp:6:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/gda_sa.cpp:7:
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/gda_sa.cpp: In function ‘std::vector<std::vector<double> > gda_neighbor_match_test(AbstractGeoDa*, unsigned int, double, bool, bool, bool, const std::vector<std::vector<double> >&, const std::string&, const std::string&)’:
libgeoda/gda_sa.cpp:414:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘unsigned int’ [-Wsign-compare]
  414 |         for (int j=0; j<knn; j++) {
      |                       ~^~~~
libgeoda/gda_sa.cpp: In function ‘std::vector<std::vector<double> > gda_neighbor_match_test(GeoDaWeight*, unsigned int, const std::vector<std::vector<double> >&, const std::string&, const std::string&)’:
libgeoda/gda_sa.cpp:514:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘unsigned int’ [-Wsign-compare]
  514 |         for (int j=0; j<knn; j++) {
      |                       ~^~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/gda_data.cpp:4:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
libgeoda/gda_data.cpp: In function ‘bool gda_rateSmootherEBS(const std::vector<double>&, const std::vector<double>&, std::vector<double>&, std::vector<bool>&)’:
libgeoda/gda_data.cpp:152:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  152 |     if (results.size() != obs) {
      |         ~~~~~~~~~~~~~~~^~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/gda_weights.cpp -o libgeoda/gda_weights.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/cstdfloat.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/float128_functions.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/fpclassify.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/default_ops.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/number.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_int.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_bin_float.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/coordinate_promotion.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/radian_access.hpp:28,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:50,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry.hpp:17,
                 from libgeoda/SpatialIndTypes.h:23,
                 from libgeoda/SpatialIndAlgs.h:9,
                 from libgeoda/gda_weights.cpp:23:
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:714:16: warning: non-standard suffix on floating constant [-Wpedantic]
  714 |                else if (x == BOOST_FLOAT128_C(0.0))
      |                ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:717:16: warning: non-standard suffix on floating constant [-Wpedantic]
  717 |                if (::BOOST_CSTDFLOAT_FLOAT128_FABS(x) < BOOST_CSTDFLOAT_FLOAT128_MIN)
      |                ^~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/gda_clustering.cpp -o libgeoda/gda_clustering.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/gda_weights.cpp:16:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/bits/shared_ptr_base.h:59,
                 from /usr/include/c++/15/bits/shared_ptr.h:53,
                 from /usr/include/c++/15/regex:51,
                 from libgeoda/gda_weights.cpp:5:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/weights/GalWeight.h:7,
                 from libgeoda/weights/PolysToContigWeights.h:7,
                 from libgeoda/gda_weights.cpp:20:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/gda_clustering.cpp:2:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
libgeoda/gda_clustering.cpp: In function ‘std::vector<int> gda_makespatial(const std::vector<int>&, GeoDaWeight*)’:
libgeoda/gda_clustering.cpp:456:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  456 |         for (int j=0; j<new_groups[i].size(); j++) {
      |                       ~^~~~~~~~~~~~~~~~~~~~~
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/SpatialIndAlgs.h:10:
libgeoda/weights/GwtWeight.h:50:7: note:   by ‘GwtWeight& GwtWeight::operator=(const GwtWeight&)’
   50 | class GwtWeight : public GeoDaWeight {
      |       ^~~~~~~~~
libgeoda/gda_weights.cpp: In function ‘GeoDaWeight* gda_load_gal(const char*, const std::vector<std::__cxx11::basic_string<char> >&)’:
libgeoda/gda_weights.cpp:248:36: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::__cxx11::basic_string<char> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  248 |     if (!id_vec.empty() && num_obs != id_vec.size()) {
      |                            ~~~~~~~~^~~~~~~~~~~~~~~~
libgeoda/gda_weights.cpp: In function ‘GeoDaWeight* gda_load_gwt(const char*, const std::vector<std::__cxx11::basic_string<char> >&)’:
libgeoda/gda_weights.cpp:400:40: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::__cxx11::basic_string<char> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  400 |         if (!id_vec.empty() && num_obs != id_vec.size()) {
      |                                ~~~~~~~~^~~~~~~~~~~~~~~~
libgeoda/gda_weights.cpp: In function ‘GeoDaWeight* gda_load_swm(const char*, const std::vector<int>&)’:
libgeoda/gda_weights.cpp:502:9: warning: variable ‘swmType’ set but not used [-Wunused-but-set-variable]
  502 |     int swmType = 0; // old
      |         ^~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/GenGeomAlgs.cpp -o libgeoda/GenGeomAlgs.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/GenUtils.cpp -o libgeoda/GenUtils.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/GenUtils.cpp:27:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/weights/GalWeight.h:7,
                 from libgeoda/GenUtils.cpp:32:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/GenUtils.cpp: In function ‘std::vector<double> GenUtils::NaturalBreaks(int, const std::vector<double>&, std::vector<bool>&)’:
libgeoda/GenUtils.cpp:2047:9: warning: variable ‘max_gvf_ind’ set but not used [-Wunused-but-set-variable]
 2047 |     int max_gvf_ind = 0;
      |         ^~~~~~~~~~~
In file included from libgeoda/GenUtils.cpp:35:
libgeoda/GdaConst.h: At global scope:
libgeoda/GdaConst.h:9:19: warning: ‘GdaConst::gda_eigen_tol’ defined but not used [-Wunused-variable]
    9 |     static double gda_eigen_tol = 0.00000001;
      |                   ^~~~~~~~~~~~~
libgeoda/GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/SpatialIndAlgs.cpp -o libgeoda/SpatialIndAlgs.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/cstdfloat.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/float128_functions.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/fpclassify.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/default_ops.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/number.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_int.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_bin_float.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/coordinate_promotion.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/radian_access.hpp:28,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:50,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry.hpp:17,
                 from libgeoda/SpatialIndTypes.h:23,
                 from libgeoda/SpatialIndAlgs.h:9,
                 from libgeoda/SpatialIndAlgs.cpp:13:
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:714:16: warning: non-standard suffix on floating constant [-Wpedantic]
  714 |                else if (x == BOOST_FLOAT128_C(0.0))
      |                ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:717:16: warning: non-standard suffix on floating constant [-Wpedantic]
  717 |                if (::BOOST_CSTDFLOAT_FLOAT128_FABS(x) < BOOST_CSTDFLOAT_FLOAT128_MIN)
      |                ^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/SpatialIndAlgs.cpp:6:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/weights/GwtWeight.h:5,
                 from libgeoda/SpatialIndAlgs.h:10:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/weights/GwtWeight.h:6:
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GwtWeight.h:50:7: note:   by ‘GwtWeight& GwtWeight::operator=(const GwtWeight&)’
   50 | class GwtWeight : public GeoDaWeight {
      |       ^~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/pg/geoms.cpp -o libgeoda/pg/geoms.o
libgeoda/SpatialIndAlgs.cpp: In function ‘GwtWeight* SpatialIndAlgs::knn_build_sub(const rtree_pt_2d_t&, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >&, int, int, int, bool, double, const std::string&, double, bool, bool)’:
libgeoda/SpatialIndAlgs.cpp:355:56: warning: comparison of integer expressions of different signedness: ‘const unsigned int’ and ‘int’ [-Wsign-compare]
  355 |                         if (kernel.empty() && w.second == i)
      |                                               ~~~~~~~~~^~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:20,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size_type.hpp:20,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:21,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/random/hyperexponential_distribution.hpp:30,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/random.hpp:71,
                 from libgeoda/SpatialIndAlgs.cpp:5:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:51:24:   required from here
   51 |         box_2d b(pt_2d(i + 0.0f, i + 0.0f), pt_2d(i + 0.5f, i + 0.5f));
      |                        ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:51:24:   required from here
   51 |         box_2d b(pt_2d(i + 0.0f, i + 0.0f), pt_2d(i + 0.5f, i + 0.5f));
      |                        ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:410:46:   required from here
  410 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:410:46:   required from here
  410 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:51:24:   required from here
   51 |         box_2d b(pt_2d(i + 0.0f, i + 0.0f), pt_2d(i + 0.5f, i + 0.5f));
      |                        ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::cartesian>; Geometry2 = model::point<double, 2, cs::cartesian>; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::cartesian>; Geometry2 = model::point<double, 2, cs::cartesian>]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:288:36:   required from here
  288 |             double d = bg::distance(v.first, w.first);
      |                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::cartesian>; Geometry2 = model::point<double, 2, cs::cartesian>; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::cartesian>; Geometry2 = model::point<double, 2, cs::cartesian>]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:288:36:   required from here
  288 |             double d = bg::distance(v.first, w.first);
      |                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:410:46:   required from here
  410 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::point<double, 3, cs::cartesian>; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::point<double, 3, cs::cartesian>]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:801:44:   required from here
  801 |                         if (w.second != v.second && bg::distance(v.first, w.first) <= th)
      |                                                     ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::point<double, 3, cs::cartesian>; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::point<double, 3, cs::cartesian>]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:801:44:   required from here
  801 |                         if (w.second != v.second && bg::distance(v.first, w.first) <= th)
      |                                                     ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::point<double, 2, cs::spherical_equatorial<degree> >; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::point<double, 2, cs::spherical_equatorial<degree> >]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1017:31:   required from here
 1017 |                         neigh.weight = bg::distance(v.first, w.first);
      |                                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::point<double, 2, cs::spherical_equatorial<degree> >; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::point<double, 2, cs::spherical_equatorial<degree> >]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1017:31:   required from here
 1017 |                         neigh.weight = bg::distance(v.first, w.first);
      |                                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:561:36:   required from ‘boost::geometry::wkt_manipulator<Geometry> boost::geometry::wkt(const Geometry&) [with Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  561 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/SpatialIndAlgs.cpp:71:26:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:561:36:   required from ‘boost::geometry::wkt_manipulator<Geometry> boost::geometry::wkt(const Geometry&) [with Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  561 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/SpatialIndAlgs.cpp:71:26:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstBox<Geometry>::~ConstBox() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  109 |     BOOST_CONCEPT_USAGE(ConstBox)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::cartesian>; Geometry2 = model::point<double, 2, cs::cartesian>; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::cartesian>; Geometry2 = model::point<double, 2, cs::cartesian>]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:288:36:   required from here
  288 |             double d = bg::distance(v.first, w.first);
      |                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::point<double, 3, cs::cartesian>; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::point<double, 3, cs::cartesian>]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:801:44:   required from here
  801 |                         if (w.second != v.second && bg::distance(v.first, w.first) <= th)
      |                                                     ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:317:37:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::point<double, 2, cs::spherical_equatorial<degree> >; Strategy = default_strategy]’
  317 |     concepts::check<Geometry1 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/interface.hpp:348:30:   required from ‘auto boost::geometry::distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::point<double, 2, cs::spherical_equatorial<degree> >]’
  348 |     return geometry::distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1017:31:   required from here
 1017 |                         neigh.weight = bg::distance(v.first, w.first);
      |                                        ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:561:36:   required from ‘boost::geometry::wkt_manipulator<Geometry> boost::geometry::wkt(const Geometry&) [with Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  561 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/SpatialIndAlgs.cpp:71:26:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |           ~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstBox<Geometry>::~ConstBox() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  109 |     BOOST_CONCEPT_USAGE(ConstBox)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5:   required from ‘class boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:98:28:   required from here
   98 |         box_2d bnds = rtree.bounds();
      |                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:98:28:   required from here
   98 |         box_2d bnds = rtree.bounds();
      |                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Box<Geometry>::~Box() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   62 |     BOOST_CONCEPT_USAGE(Box)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5:   required from ‘class boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 3, cs::cartesian> >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:410:46:   required from here
  410 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 3, cs::cartesian> >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:410:46:   required from here
  410 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Box<Geometry>::~Box() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   62 |     BOOST_CONCEPT_USAGE(Box)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5:   required from ‘class boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Box<Geometry>::~Box() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   62 |     BOOST_CONCEPT_USAGE(Box)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5:   required from ‘class boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:98:28:   required from here
   98 |         box_2d bnds = rtree.bounds();
      |                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Box<Geometry>::~Box() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   62 |     BOOST_CONCEPT_USAGE(Box)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5:   required from ‘class boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 3, cs::cartesian> >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:410:46:   required from here
  410 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Box<Geometry>::~Box() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   62 |     BOOST_CONCEPT_USAGE(Box)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5:   required from ‘class boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Box<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:91:30:   required from ‘void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >]’
   91 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1495:33:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1495 |         geometry::assign_inverse(result);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Box<Geometry>::~Box() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   62 |     BOOST_CONCEPT_USAGE(Box)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:152:13:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:152:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, false, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, false, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::point<double, 2, geometry::cs::cartesian>, true, false, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:130:24:   required from ‘static void boost::geometry::detail::wkt::wkt_range<Range, PrefixPolicy, ForceClosurePossible, WriteDoubleBrackets>::apply(std::basic_ostream<CharT, Traits>&, const Range&, bool) [with Char = char; Traits = std::char_traits<char>; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; PrefixPolicy = boost::geometry::detail::wkt::prefix_null; bool ForceClosurePossible = false; bool WriteDoubleBrackets = false]’
  130 |         if (boost::size(range) > 0)
      |             ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:291:49:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  291 |             wkt_sequence<RingType, false>::apply(os, ring);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:191:13:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:191:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:218:14:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:218:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:239:14:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:239:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:72:21:   required from ‘constexpr void boost::geometry::concepts::check_concepts_and_equal_dimensions() [with Geometry1 = const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
   72 |     check<Geometry2>();
      |     ~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Ring<Geometry>::~Ring() [with Geometry = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(Ring)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:72:21:   required from ‘constexpr void boost::geometry::concepts::check_concepts_and_equal_dimensions() [with Geometry1 = const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
   72 |     check<Geometry2>();
      |     ~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Ring<Geometry>::~Ring() [with Geometry = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(Ring)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:417:14:   required from here
  417 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:251:37:   required from ‘auto boost::geometry::comparable_distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::box<model::point<double, 3, cs::cartesian> >; Strategy = default_strategy]’
  251 |     concepts::check<Geometry2 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:282:41:   required from ‘auto boost::geometry::comparable_distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 3, cs::cartesian>; Geometry2 = model::box<model::point<double, 3, cs::cartesian> >]’
  282 |     return geometry::comparable_distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:141:45:   required from ‘static boost::geometry::index::detail::comparable_distance_call<G1, G2, boost::geometry::default_strategy>::result_type boost::geometry::index::detail::comparable_distance_call<G1, G2, boost::geometry::default_strategy>::apply(const G1&, const G2&, const boost::geometry::default_strategy&) [with G1 = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>; G2 = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; result_type = double]’
  141 |         return geometry::comparable_distance(g1, g2);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:417:14:   required from here
  417 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstBox<Geometry>::~ConstBox() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  109 |     BOOST_CONCEPT_USAGE(ConstBox)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1010:14:   required from here
 1010 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:251:37:   required from ‘auto boost::geometry::comparable_distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >; Strategy = default_strategy]’
  251 |     concepts::check<Geometry2 const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:282:41:   required from ‘auto boost::geometry::comparable_distance(const Geometry1&, const Geometry2&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >]’
  282 |     return geometry::comparable_distance(geometry1, geometry2, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:141:45:   required from ‘static boost::geometry::index::detail::comparable_distance_call<G1, G2, boost::geometry::default_strategy>::result_type boost::geometry::index::detail::comparable_distance_call<G1, G2, boost::geometry::default_strategy>::apply(const G1&, const G2&, const boost::geometry::default_strategy&) [with G1 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; G2 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; result_type = double]’
  141 |         return geometry::comparable_distance(g1, g2);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1010:14:   required from here
 1010 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstBox<Geometry>::~ConstBox() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  109 |     BOOST_CONCEPT_USAGE(ConstBox)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5:   required from ‘struct boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/spherical/distance_cross_track_point_box.hpp:265:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1010:14:   required from here
 1010 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/spherical/distance_cross_track_point_box.hpp:265:9:   required from ‘typename boost::geometry::strategy::distance::cross_track_point_box<CalculationType, Strategy>::return_type<Point, Box>::type boost::geometry::strategy::distance::cross_track_point_box<CalculationType, Strategy>::apply(const Point&, const Box&) const [with Point = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; CalculationType = void; Strategy = boost::geometry::strategy::distance::comparable::haversine<double, void>; typename return_type<Point, Box>::type = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/distance/point_to_geometry.hpp:141:53:   required from ‘static auto boost::geometry::detail::distance::point_to_box<Point, Box, Strategies, IsUmbrella>::apply(const Point&, const Box&, const Strategies&) [with Point = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategies = boost::geometry::strategies::distance::detail::comparable<boost::geometry::strategies::distance::spherical<> >; bool IsUmbrella = true]’
  141 |         return strategies.distance(point, box).apply(point, box);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:113:21:   required from ‘static auto boost::geometry::resolve_strategy::comparable_distance<boost::geometry::default_strategy, false>::apply(const Geometry1&, const Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Geometry2 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
  110 |         return dispatch::distance
      |                ~~~~~~~~~~~~~~~~~~
  111 |             <
      |             ~        
  112 |                 Geometry1, Geometry2, comparable_strategy_type
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  113 |             >::apply(geometry1, geometry2, comparable_strategy_type());
      |             ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:140:21:   required from ‘static auto boost::geometry::resolve_dynamic::comparable_distance<Geometry1, Geometry2, Tag1, Tag2>::apply(const Geometry1&, const Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Geometry2 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Tag1 = boost::geometry::point_tag; Tag2 = boost::geometry::box_tag]’
  137 |         return resolve_strategy::comparable_distance
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  138 |             <
      |             ~        
  139 |                 Strategy
      |                 ~~~~~~~~
  140 |             >::apply(geometry1, geometry2, strategy);
      |             ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:257:17:   required from ‘auto boost::geometry::comparable_distance(const Geometry1&, const Geometry2&, const Strategy&) [with Geometry1 = model::point<double, 2, cs::spherical_equatorial<degree> >; Geometry2 = model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >; Strategy = default_strategy]’
  253 |     return resolve_dynamic::comparable_distance
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  254 |         <
      |         ~        
  255 |             Geometry1,
      |             ~~~~~~~~~~
  256 |             Geometry2
      |             ~~~~~~~~~
  257 |         >::apply(geometry1, geometry2, strategy);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:282:41:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1010:14:   required from here
 1010 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::PointDistanceStrategy<Strategy, Point1, Point2>::~PointDistanceStrategy() [with Strategy = boost::geometry::strategy::distance::comparable::haversine<double, void>; Point1 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Point2 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  127 |     BOOST_CONCEPT_USAGE(PointDistanceStrategy)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>*, std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Ring<Geometry>::~Ring() [with Geometry = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(Ring)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:499:55:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  499 |         dispatch::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<C>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&; typename boost::range_iterator<C>::type = std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&; typename boost::range_reference<T>::type = boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:114:22:   required from ‘static void boost::geometry::detail::conversion::box_to_range<Box, Range, Close, Reverse>::apply(const Box&, Range&) [with Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; bool Close = true; bool Reverse = false]’
  114 |             range::at(range, 4) = range::at(range, 0);
      |             ~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:499:55:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  499 |         dispatch::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:498:82:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  498 |         concepts::check_concepts_and_equal_dimensions<Geometry1 const, Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Ring<Geometry>::~Ring() [with Geometry = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(Ring)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:499:55:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  499 |         dispatch::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<C>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&; typename boost::range_iterator<C>::type = std::vector<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&; typename boost::range_reference<T>::type = boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:114:22:   required from ‘static void boost::geometry::detail::conversion::box_to_range<Box, Range, Close, Reverse>::apply(const Box&, Range&) [with Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Range = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; bool Close = false; bool Reverse = false]’
  114 |             range::at(range, 4) = range::at(range, 0);
      |             ~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:499:55:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  499 |         dispatch::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:417:14:   required from here
  417 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstBox<Geometry>::~ConstBox() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  109 |     BOOST_CONCEPT_USAGE(ConstBox)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstBox<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1010:14:   required from here
 1010 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstBox<Geometry>::~ConstBox() [with Geometry = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  109 |     BOOST_CONCEPT_USAGE(ConstBox)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5:   required from ‘struct boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::PointDistanceStrategy<boost::geometry::strategy::distance::comparable::haversine<double, void>, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34:   required from ‘static bool boost::geometry::index::detail::calculate_distance<boost::geometry::index::detail::predicates::nearest<DistancePredicates>, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest<DistancePredicates>&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Indexable = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Strategy = boost::geometry::default_strategy; Tag = boost::geometry::index::detail::bounds_tag; result_type = double]’
  173 |         result = call_type::apply(relation::value(p.point_or_relation), i, s);
      |                  ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int; node_pointer = boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*]’
  240 |                         && calculate_node_distance::apply(predicate(), p.first, m_strategy, node_distance)
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21:   required from ‘boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::size_type boost::geometry::index::detail::rtree::visitors::distance_query<MembersHolder, Predicates>::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; size_type = long unsigned int]’
  213 |         return apply(members.root, members.leafs_level, out_it);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1891:32:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance<Predicates>::value > 0), int>::type <anonymous> = 0; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1891 |         return distance_v.apply(m_members, out_it);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1088:30:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::size_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; OutIter = std::back_insert_iterator<std::vector<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; size_type = long unsigned int]’
 1088 |              ? query_dispatch(predicates, out_it)
      |                ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1010:14:   required from here
 1010 |                 rtree.query(bgi::nearest(v.first, k), std::back_inserter(q));
      |                 ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::PointDistanceStrategy<Strategy, Point1, Point2>::~PointDistanceStrategy() [with Strategy = boost::geometry::strategy::distance::comparable::haversine<double, void>; Point1 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >; Point2 = boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  127 |     BOOST_CONCEPT_USAGE(PointDistanceStrategy)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:499:55:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>]’
  499 |         dispatch::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, true, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:268:59:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  268 |             do_apply<model::ring<point_type, true, true> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, true, std::vector, std::allocator>&]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:499:55:   required from ‘static void boost::geometry::resolve_variant::convert<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Geometry2 = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>]’
  499 |         dispatch::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/convert.hpp:551:58:   required from ‘void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box<model::point<double, 2, cs::cartesian> >; Geometry2 = model::ring<model::point<double, 2, cs::cartesian>, true, false, std::vector, std::allocator>]’
  551 |     resolve_variant::convert<Geometry1, Geometry2>::apply(geometry1, geometry2);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:289:30:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::do_apply(std::basic_ostream<Char, Traits>&, const Box&) [with RingType = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  289 |             geometry::convert(box, ring);
      |             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:272:60:   required from ‘static void boost::geometry::detail::wkt::wkt_box<Box>::apply(std::basic_ostream<CharT, Traits>&, const Box&, bool) [with Char = char; Traits = std::char_traits<char>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >]’
  272 |             do_apply<model::ring<point_type, true, false> >(os, box);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/wkt/write.hpp:541:39:   required from ‘std::basic_ostream<CharT, Traits>& boost::geometry::operator<<(std::basic_ostream<CharT, Traits>&, const wkt_manipulator<Geometry>&) [with Char = char; Traits = std::char_traits<char>; Geometry = model::box<model::point<double, 2, cs::cartesian> >]’
  541 |         dispatch::wkt<Geometry>::apply(os, m.m_geometry, m.m_force_closure);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:71:36:   required from here
   71 |     ss << bg::wkt<box_2d>(query_box) << std::endl;
      |                                    ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, true, false, std::vector, std::allocator>&]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:29,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:20:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*; Value = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, boost::geometry::index::detail::rtree::insert_default_tag>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int> >, std::pair<geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:837:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const value_type&) [with Value = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >; value_type = std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>]’
  837 |         this->raw_insert(value);
      |         ~~~~~~^~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:53:21:   required from here
   53 |         rtree.insert(std::make_pair(b, i));
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int> >, std::pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*; Value = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*; Value = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/varray.hpp:268:9:   required from ‘boost::geometry::index::detail::varray<Value, Capacity>::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*; Value = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long unsigned int Capacity = 17]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24:   required from ‘static void boost::geometry::index::detail::rtree::redistribute_elements<MembersHolder, boost::geometry::index::detail::rtree::quadratic_tag>::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  131 |         container_type elements_copy(elements1.begin(), elements1.end());                                   // MAY THROW, STRONG (alloc, copy)
      |                        ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24:   required from ‘static void boost::geometry::index::detail::rtree::split<MembersHolder, boost::geometry::index::detail::rtree::split_default_tag>::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>, 1>; box_type = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator<boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>]’
  189 |             redistribute_elements<MembersHolder>
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  190 |                 ::apply(n, n2, n_box, box2, parameters, translator, allocators);                                   // MAY THROW (V, E: alloc, copy, copy)
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  406 |         split_algo::apply(additional_nodes, n, n_box, m_parameters, m_translator, m_allocators);                // MAY THROW (V, E: alloc, copy, N:alloc)
      |         ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18:   required from ‘void boost::geometry::index::detail::rtree::visitors::detail::insert<Element, MembersHolder>::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; MembersHolder = boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]’
  375 |             split(n);                                                                                           // MAY THROW (V, E: alloc, copy, N:alloc)
      |             ~~~~~^~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function ‘boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro ‘BOOST_concept’
   29 |     struct name
      |            ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1084:15:   required from here
 1084 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1096:15:   required from here
 1096 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:108:3:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  108 |   BOOST_concept(IncrementableIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7:   required from ‘struct boost_concepts::IncrementableIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost_concepts::IncrementableIterator<Iterator>::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  120 |       BOOST_CONCEPT_USAGE(IncrementableIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:129:3:   required from ‘struct boost_concepts::SinglePassIterator<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  129 |   BOOST_concept(SinglePassIterator,(Iterator))
      |                 ^~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:141:3:   required from ‘struct boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>’
  141 |   BOOST_concept(ForwardTraversal,(Iterator))
      |                 ^~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost_concepts::ForwardTraversal<boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::insert<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::rtree<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int> >, std::pair<geometry::model::point<double, 3, geometry::cs::cartesian>, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 3, geometry::cs::cartesian> >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::insert<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1668:37:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::raw_insert(const value_type&) [with Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; value_type = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>]’
 1668 |         detail::rtree::apply_visitor(insert_v, *m_members.root);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1799:15:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; std::true_type = std::true_type]’
 1799 |         this->raw_insert(val_conv);
      |         ~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:893:30:   required from ‘void boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, long unsigned int>; Value = std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >]’
  893 |         this->insert_dispatch(conv_or_rng, is_conv_t());
      |         ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1109:15:   required from here
 1109 |                 rtree.insert(std::make_pair(p, i));
      |                 ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair<boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::variant<boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int> >, std::pair<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian>, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 3, boost::geometry::cs::cartesian> >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:342:41:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
  342 |         concepts::check<Geometry1 const>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:357:21:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
  357 |         return apply(
      |                ~~~~~^
  358 |             geometry1,
      |             ~~~~~~~~~~
  359 |             geometry2,
      |             ~~~~~~~~~~
  360 |             typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         );
      |         ~            
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:378:50:   required from ‘static bool boost::geometry::resolve_variant::transform<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
  378 |         return resolve_strategy::transform::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  379 |             geometry1,
      |             ~~~~~~~~~~                            
  380 |             geometry2,
      |             ~~~~~~~~~~                            
  381 |             strategy
      |             ~~~~~~~~                              
  382 |         );
      |         ~                                         
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:445:34:   required from ‘bool boost::geometry::transform(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = detail::two_dimensional_view<const model::point<double, 2, cs::spherical_equatorial<degree> >, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view<model::point<double, 2, cs::spherical_equatorial<degree> >, 0, 1, point_tag>; Strategy = default_strategy]’
  444 |     return resolve_variant::transform<Geometry1, Geometry2>
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |                           ::apply(geometry1, geometry2, strategy);
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:463:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:343:35:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
  343 |         concepts::check<Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:357:21:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
  357 |         return apply(
      |                ~~~~~^
  358 |             geometry1,
      |             ~~~~~~~~~~
  359 |             geometry2,
      |             ~~~~~~~~~~
  360 |             typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         );
      |         ~            
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:378:50:   required from ‘static bool boost::geometry::resolve_variant::transform<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
  378 |         return resolve_strategy::transform::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  379 |             geometry1,
      |             ~~~~~~~~~~                            
  380 |             geometry2,
      |             ~~~~~~~~~~                            
  381 |             strategy
      |             ~~~~~~~~                              
  382 |         );
      |         ~                                         
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:445:34:   required from ‘bool boost::geometry::transform(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = detail::two_dimensional_view<const model::point<double, 2, cs::spherical_equatorial<degree> >, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view<model::point<double, 2, cs::spherical_equatorial<degree> >, 0, 1, point_tag>; Strategy = default_strategy]’
  444 |     return resolve_variant::transform<Geometry1, Geometry2>
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |                           ::apply(geometry1, geometry2, strategy);
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:463:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:342:41:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
  342 |         concepts::check<Geometry1 const>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:357:21:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
  357 |         return apply(
      |                ~~~~~^
  358 |             geometry1,
      |             ~~~~~~~~~~
  359 |             geometry2,
      |             ~~~~~~~~~~
  360 |             typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         );
      |         ~            
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:378:50:   required from ‘static bool boost::geometry::resolve_variant::transform<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
  378 |         return resolve_strategy::transform::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  379 |             geometry1,
      |             ~~~~~~~~~~                            
  380 |             geometry2,
      |             ~~~~~~~~~~                            
  381 |             strategy
      |             ~~~~~~~~                              
  382 |         );
      |         ~                                         
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:445:34:   required from ‘bool boost::geometry::transform(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = detail::two_dimensional_view<const detail::indexed_point_view<const model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 0>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view<detail::indexed_point_view<model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 0>, 0, 1, point_tag>; Strategy = default_strategy]’
  444 |     return resolve_variant::transform<Geometry1, Geometry2>
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |                           ::apply(geometry1, geometry2, strategy);
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:463:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:343:35:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
  343 |         concepts::check<Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:357:21:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
  357 |         return apply(
      |                ~~~~~^
  358 |             geometry1,
      |             ~~~~~~~~~~
  359 |             geometry2,
      |             ~~~~~~~~~~
  360 |             typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         );
      |         ~            
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:378:50:   required from ‘static bool boost::geometry::resolve_variant::transform<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
  378 |         return resolve_strategy::transform::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  379 |             geometry1,
      |             ~~~~~~~~~~                            
  380 |             geometry2,
      |             ~~~~~~~~~~                            
  381 |             strategy
      |             ~~~~~~~~                              
  382 |         );
      |         ~                                         
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:445:34:   required from ‘bool boost::geometry::transform(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = detail::two_dimensional_view<const detail::indexed_point_view<const model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 0>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view<detail::indexed_point_view<model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 0>, 0, 1, point_tag>; Strategy = default_strategy]’
  444 |     return resolve_variant::transform<Geometry1, Geometry2>
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |                           ::apply(geometry1, geometry2, strategy);
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:463:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:342:41:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
  342 |         concepts::check<Geometry1 const>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:357:21:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
  357 |         return apply(
      |                ~~~~~^
  358 |             geometry1,
      |             ~~~~~~~~~~
  359 |             geometry2,
      |             ~~~~~~~~~~
  360 |             typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         );
      |         ~            
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:378:50:   required from ‘static bool boost::geometry::resolve_variant::transform<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
  378 |         return resolve_strategy::transform::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  379 |             geometry1,
      |             ~~~~~~~~~~                            
  380 |             geometry2,
      |             ~~~~~~~~~~                            
  381 |             strategy
      |             ~~~~~~~~                              
  382 |         );
      |         ~                                         
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:445:34:   required from ‘bool boost::geometry::transform(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = detail::two_dimensional_view<const detail::indexed_point_view<const model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 1>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view<detail::indexed_point_view<model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 1>, 0, 1, point_tag>; Strategy = default_strategy]’
  444 |     return resolve_variant::transform<Geometry1, Geometry2>
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |                           ::apply(geometry1, geometry2, strategy);
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:463:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:343:35:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
  343 |         concepts::check<Geometry2>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:357:21:   required from ‘static bool boost::geometry::resolve_strategy::transform::apply(const Geometry1&, Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
  357 |         return apply(
      |                ~~~~~^
  358 |             geometry1,
      |             ~~~~~~~~~~
  359 |             geometry2,
      |             ~~~~~~~~~~
  360 |             typename detail::transform::select_strategy<Geometry1, Geometry2>::type()
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  361 |         );
      |         ~            
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:378:50:   required from ‘static bool boost::geometry::resolve_variant::transform<Geometry1, Geometry2>::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
  378 |         return resolve_strategy::transform::apply(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
  379 |             geometry1,
      |             ~~~~~~~~~~                            
  380 |             geometry2,
      |             ~~~~~~~~~~                            
  381 |             strategy
      |             ~~~~~~~~                              
  382 |         );
      |         ~                                         
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:445:34:   required from ‘bool boost::geometry::transform(const Geometry1&, Geometry2&, const Strategy&) [with Geometry1 = detail::two_dimensional_view<const detail::indexed_point_view<const model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 1>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view<detail::indexed_point_view<model::box<model::point<double, 2, cs::spherical_equatorial<degree> > >, 1>, 0, 1, point_tag>; Strategy = default_strategy]’
  444 |     return resolve_variant::transform<Geometry1, Geometry2>
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  445 |                           ::apply(geometry1, geometry2, strategy);
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/transform.hpp:463:31:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view<const boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 0>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view<const boost::geometry::detail::indexed_point_view<const boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2214:43:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor<boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2214 |         return internal_apply_visitor_impl(
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
 2215 |               which_, which(), visitor, storage_.address()
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 2216 |             );
      |             ~                              
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/variant.hpp:2251:44:   required from ‘typename Visitor::result_type boost::variant<T0, TN>::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; TN = {boost::geometry::index::detail::rtree::variant_internal_node<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>}; typename Visitor::result_type = void]’
 2251 |         return this->internal_apply_visitor(invoker);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/variant/detail/apply_visitor_unary.hpp:47:60:   required from ‘typename Visitor::result_type boost::apply_visitor(Visitor&, Visitable&&) [with Visitor = geometry::index::detail::rtree::visitors::children_box<geometry::index::rtree<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant<geometry::index::detail::rtree::variant_leaf<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::allocators<container::new_allocator<std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int> >, std::pair<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box<geometry::model::point<double, 2, geometry::cs::spherical_equatorial<geometry::degree> > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag> >&; typename Visitor::result_type = void]’
   47 |     return std::forward<Visitable>(visitable).apply_visitor(visitor);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/detail/rtree/node/variant_visitor.hpp:51:25:   required from ‘void boost::geometry::index::detail::rtree::apply_visitor(Visitor&, boost::variant<variant_leaf<Value, Parameters, Box, Allocators, Tag>, variant_internal_node<Value, Parameters, Box, Allocators, Tag> >&) [with Visitor = visitors::children_box<boost::geometry::index::rtree<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >; Allocators = allocators<boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >, std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, node_variant_static_tag>; Tag = node_variant_static_tag]’
   51 |     boost::apply_visitor(v, n);
      |     ~~~~~~~~~~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/index/rtree.hpp:1503:41:   required from ‘boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds_type boost::geometry::index::rtree<Value, Options, IndexableGetter, EqualTo, Allocator>::bounds() const [with Value = std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; EqualTo = boost::geometry::index::equal_to<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; Allocator = boost::container::new_allocator<std::pair<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> >, unsigned int> >; bounds_type = boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >]’
 1503 |             detail::rtree::apply_visitor(box_v, *m_members.root);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/SpatialIndAlgs.cpp:1004:46:   required from here
 1004 |                          rtree.qbegin(bgi::intersects(rtree.bounds()));
      |                                                       ~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view<boost::geometry::detail::indexed_point_view<boost::geometry::model::box<boost::geometry::model::point<double, 2, boost::geometry::cs::spherical_equatorial<boost::geometry::degree> > >, 1>, 0, 1, boost::geometry::point_tag>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/pg/utils.cpp -o libgeoda/pg/utils.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/shapelib/dbfopen.cpp -o libgeoda/shapelib/dbfopen.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/shapelib/safileio.cpp -o libgeoda/shapelib/safileio.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/shapelib/shpopen.cpp -o libgeoda/shapelib/shpopen.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/weights/PointsToContigWeights.cpp -o libgeoda/weights/PointsToContigWeights.o
libgeoda/weights/PointsToContigWeights.cpp: In function ‘bool gda::PointsToContiguity(const std::vector<double>&, const std::vector<double>&, bool, std::vector<std::set<int> >&)’:
libgeoda/weights/PointsToContigWeights.cpp:99:23: warning: comparison of integer expressions of different signedness: ‘size_t’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   99 |     for (size_t i=0; i<diagram.numsites; i++) {
      |                      ~^~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/weights/PolysToContigWeights.cpp -o libgeoda/weights/PolysToContigWeights.o
In file included from libgeoda/weights/GalWeight.h:7,
                 from libgeoda/weights/PolysToContigWeights.h:7,
                 from libgeoda/weights/PolysToContigWeights.cpp:6:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/weights/GalWeight.cpp -o libgeoda/weights/GalWeight.o
In file included from libgeoda/weights/GalWeight.h:7,
                 from libgeoda/weights/GalWeight.cpp:17:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/weights/GalWeight.cpp:18:
libgeoda/weights/GwtWeight.h:50:7: note:   by ‘GwtWeight& GwtWeight::operator=(const GwtWeight&)’
   50 | class GwtWeight : public GeoDaWeight {
      |       ^~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/weights/GwtWeight.cpp -o libgeoda/weights/GwtWeight.o
In file included from libgeoda/weights/GwtWeight.h:5,
                 from libgeoda/weights/GwtWeight.cpp:1:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/weights/GwtWeight.h:6:
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GwtWeight.h:50:7: note:   by ‘GwtWeight& GwtWeight::operator=(const GwtWeight&)’
   50 | class GwtWeight : public GeoDaWeight {
      |       ^~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/weights/GeodaWeight.cpp -o libgeoda/weights/GeodaWeight.o
libgeoda/weights/GeodaWeight.cpp: In member function ‘virtual bool GeoDaWeight::CheckConnectivity()’:
libgeoda/weights/GeodaWeight.cpp:81:20: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   81 |     for (int i=0; i<nbrs.size(); i++) {
      |                   ~^~~~~~~~~~~~
libgeoda/weights/GeodaWeight.cpp:92:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   92 |         for (int i=0; i<tmp_nbrs.size(); i++) {
      |                       ~^~~~~~~~~~~~~~~~
libgeoda/weights/GeodaWeight.cpp:100:28: warning: comparison of integer expressions of different signedness: ‘std::map<int, bool>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  100 |     if (access_dict.size() < num_obs) {
      |         ~~~~~~~~~~~~~~~~~~~^~~~~~~~~
libgeoda/weights/GeodaWeight.cpp:107:32: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  107 |                 for (int j=0; j<tmp_nbrs.size(); j++) {
      |                               ~^~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/weights/VoronoiUtils.cpp -o libgeoda/weights/VoronoiUtils.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/cstdfloat.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/float128_functions.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/fpclassify.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/default_ops.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/number.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_int.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_bin_float.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/coordinate_promotion.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/radian_access.hpp:28,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:50,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry.hpp:17,
                 from libgeoda/weights/VoronoiUtils.cpp:27:
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:714:16: warning: non-standard suffix on floating constant [-Wpedantic]
  714 |                else if (x == BOOST_FLOAT128_C(0.0))
      |                ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:717:16: warning: non-standard suffix on floating constant [-Wpedantic]
  717 |                if (::BOOST_CSTDFLOAT_FLOAT128_FABS(x) < BOOST_CSTDFLOAT_FLOAT128_MIN)
      |                ^~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/BatchLISA.cpp -o libgeoda/sa/BatchLISA.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/svg/svg_mapper.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:129:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:25:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/multi/geometries/multi_point.hpp:17,
                 from libgeoda/weights/VoronoiUtils.cpp:30:
/data/gannet/ripley/R/test-dev/BH/include/boost/config/pragma_message.hpp:24:34: note: ‘#pragma message: This include file is deprecated and will be removed in Boost 1.86’
   24 | # define BOOST_PRAGMA_MESSAGE(x) _Pragma(BOOST_STRINGIZE(message(x)))
      |                                  ^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/multi/geometries/multi_point.hpp:18:1: note: in expansion of macro ‘BOOST_PRAGMA_MESSAGE’
   18 | BOOST_PRAGMA_MESSAGE("This include file is deprecated and will be removed in Boost 1.86")
      | ^~~~~~~~~~~~~~~~~~~~
In file included from libgeoda/weights/GalWeight.h:7,
                 from libgeoda/weights/VoronoiUtils.cpp:35:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/BatchLocalMoran.cpp -o libgeoda/sa/BatchLocalMoran.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/LISA.cpp -o libgeoda/sa/LISA.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/MultiGeary.cpp -o libgeoda/sa/MultiGeary.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/sa/LISA.cpp:8:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
libgeoda/sa/LISA.cpp: In member function ‘virtual void LISA::PermCalcPseudoP_range(int, int, uint64_t)’:
libgeoda/sa/LISA.cpp:477:36: warning: comparison of integer expressions of different signedness: ‘size_t’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  477 |         for (size_t perm = 0; perm < permutations; perm++) {
      |                               ~~~~~^~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/MultiJoinCount.cpp -o libgeoda/sa/MultiJoinCount.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/UniG.cpp -o libgeoda/sa/UniG.o
libgeoda/sa/MultiJoinCount.cpp: In member function ‘virtual void MultiJoinCount::PermCalcPseudoP_range(int, int, uint64_t)’:
libgeoda/sa/MultiJoinCount.cpp:217:36: warning: comparison of integer expressions of different signedness: ‘size_t’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  217 |         for (size_t perm = 0; perm < permutations; perm++) {
      |                               ~~~~~^~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/UniGeary.cpp -o libgeoda/sa/UniGeary.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/UniGstar.cpp -o libgeoda/sa/UniGstar.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/UniJoinCount.cpp -o libgeoda/sa/UniJoinCount.o
In file included from libgeoda/sa/UniJoinCount.cpp:9:
libgeoda/sa/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/sa/../weights/GwtWeight.h:6,
                 from libgeoda/sa/UniJoinCount.cpp:10:
libgeoda/sa/../weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/sa/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/sa/../weights/GwtWeight.h:50:7: note:   by ‘GwtWeight& GwtWeight::operator=(const GwtWeight&)’
   50 | class GwtWeight : public GeoDaWeight {
      |       ^~~~~~~~~
libgeoda/sa/UniJoinCount.cpp: In member function ‘virtual void UniJoinCount::PermCalcPseudoP_range(int, int, uint64_t)’:
libgeoda/sa/UniJoinCount.cpp:218:36: warning: comparison of integer expressions of different signedness: ‘size_t’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  218 |         for (size_t perm = 0; perm < permutations; perm++) {
      |                               ~~~~~^~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/UniLocalMoran.cpp -o libgeoda/sa/UniLocalMoran.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/sa/BiLocalMoran.cpp -o libgeoda/sa/BiLocalMoran.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/fastcluster.cpp -o libgeoda/clustering/fastcluster.o
In file included from libgeoda/clustering/fastcluster.cpp:8:
libgeoda/clustering/fastcluster.h: In member function ‘void fastcluster::python_dissimilarity::nbool_correspond_tfft(t_index, t_index) const’:
libgeoda/clustering/fastcluster.h:912:38: warning: ‘~’ on an expression of type ‘bool’ [-Wbool-operation]
  912 |                 NTF += (Xb(i,k) & ~Xb(j,k)) ;
      |                                    ~~^~~~~
libgeoda/clustering/fastcluster.h:912:38: note: did you mean to use logical not (‘!’)?
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/redcap.cpp -o libgeoda/clustering/redcap.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/redcap_wrapper.cpp -o libgeoda/clustering/redcap_wrapper.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/properties.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/named_function_params.hpp:26,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:20,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15,
                 from libgeoda/clustering/redcap.cpp:31:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/allocator_constructed.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/implementation.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/map.hpp:8,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/unordered_map.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered_map.hpp:17,
                 from libgeoda/clustering/redcap.cpp:30:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/clustering/redcap_wrapper.cpp:5:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr.hpp:17,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:26:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/clustering/../weights/GalWeight.h:7,
                 from libgeoda/clustering/redcap.h:34,
                 from libgeoda/clustering/redcap.cpp:33:
libgeoda/clustering/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/../weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/clustering/redcap.cpp: In member function ‘void SpanningTreeClustering::AbstractClusterFactory::init()’:
libgeoda/clustering/redcap.cpp:596:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  596 |         for (int j=0; j<nbrs.size(); j++) {
      |                       ~^~~~~~~~~~~~
libgeoda/clustering/redcap.cpp: In member function ‘virtual void SpanningTreeClustering::Skater::Clustering()’:
libgeoda/clustering/redcap.cpp:702:24: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  702 |         for (int j=0; j<nbrs.size(); j++) {
      |                       ~^~~~~~~~~~~~
In file included from libgeoda/clustering/.././weights/GalWeight.h:7,
                 from libgeoda/clustering/../DataUtils.h:20,
                 from libgeoda/clustering/redcap_wrapper.cpp:7:
libgeoda/clustering/.././weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/.././weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
                 from libgeoda/clustering/redcap.h:31,
                 from libgeoda/clustering/redcap_wrapper.cpp:9:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:27:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:19:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:20:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/int.hpp:20,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/if.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_traits.hpp:17,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:14:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >::~IncidenceGraphConcept()’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:65:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   37 |     void constraints()
      |          ^~~~~~~~~~~
In file included from libgeoda/clustering/redcap_wrapper.cpp:8:
libgeoda/clustering/cluster.h: At global scope:
libgeoda/clustering/cluster.h:41:12: warning: ‘reset_random’ defined but not used [-Wunused-variable]
   41 | static int reset_random = 0;
      |            ^~~~~~~~~~~~
libgeoda/clustering/cluster.h:40:12: warning: ‘random_state’ defined but not used [-Wunused-variable]
   40 | static int random_state = -1;
      |            ^~~~~~~~~~~~
In file included from libgeoda/clustering/../DataUtils.h:19:
libgeoda/clustering/../GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:7:32: warning: ‘GdaConst::gda_user_seed’ defined but not used [-Wunused-variable]
    7 |     static unsigned long long  gda_user_seed = 123456789;
      |                                ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
  417 |     dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
      |     ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  418 |         index_map, compare, combine, inf, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
  205 |     void constraints() {
      |          ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:39:9:   required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:65:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >::~CopyConstructibleConcept()’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |   ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:206:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:207:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
  179 |     void constraints() {
      |          ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:208:7:   required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46:   required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>]’
  245 |             return make_iterator_property_map(array_holder.get(), index);
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33:   required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>]’
  273 |             return helper::build(g, index, array_holder);
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  377 |         = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  387 |     breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
      |     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
  464 |     dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  465 |         weight, index_map, compare, combine, zero, vis, color);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3:   required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
  165 |   BOOST_concept(CopyConstructible,(TT))
      |                 ^~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:206:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:180:7:   required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:207:7:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<long unsigned int*>’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5:   required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32:   required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  528 |         dijkstra_shortest_paths(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  529 |             choose_param(get_param(params, vertex_predecessor), p_map),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  530 |             distance, weight, index_map,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  531 |             choose_param(
      |             ~~~~~~~~~~~~~       
  532 |                 get_param(params, distance_compare_t()), std::less< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  533 |             choose_param(
      |             ~~~~~~~~~~~~~       
  534 |                 get_param(params, distance_combine_t()), std::plus< D >()),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  535 |             inf, choose_param(get_param(params, distance_zero_t()), D()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  536 |             choose_param(get_param(params, graph_visitor),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  537 |                 make_dijkstra_visitor(null_visitor())),
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  538 |             params);
      |             ~~~~~~~             
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35:   required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
  554 |         detail::dijkstra_dispatch2(g, s,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
  555 |             choose_param(distance,
      |             ~~~~~~~~~~~~~~~~~~~~~~ 
  556 |                 make_iterator_property_map(
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  557 |                     distance_map.begin(), index_map, distance_map[0])),
      |                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  558 |             weight, index_map, params);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31:   required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>, edge_weight_t, bgl_named_params<int*, vertex_predecessor_t, no_property> > >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
  570 |     detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  571 |         choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  572 |         choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  573 |         params);
      |         ~~~~~~~                
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32:   required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<G>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
   43 |         dijkstra_shortest_paths(
      |         ~~~~~~~~~~~~~~~~~~~~~~~^
   44 |             G, s, params.distance_compare(compare).distance_combine(combine));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26:   required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; PredecessorMap = int*]’
   77 |     detail::prim_mst_impl(g, *vertices(g).first,
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
   78 |         predecessor_map(p_map).weight_map(get(edge_weight, g)),
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   79 |         get(edge_weight, g));
      |         ~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/redcap.cpp:721:38:   required from here
  721 |     boost::prim_minimum_spanning_tree(g, p.data());
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/azp.cpp -o libgeoda/clustering/azp.o
In file included from libgeoda/clustering/.././weights/GalWeight.h:7,
                 from libgeoda/clustering/../DataUtils.h:20,
                 from libgeoda/clustering/azp.cpp:7:
libgeoda/clustering/.././weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/.././weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
In file included from libgeoda/clustering/../DataUtils.h:19:
libgeoda/clustering/../GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:7:32: warning: ‘GdaConst::gda_user_seed’ defined but not used [-Wunused-variable]
    7 |     static unsigned long long  gda_user_seed = 123456789;
      |                                ^~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/maxp_wrapper.cpp -o libgeoda/clustering/maxp_wrapper.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/clustering/maxp_wrapper.cpp:5:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/clustering/../weights/GalWeight.h:7,
                 from libgeoda/clustering/maxp_wrapper.cpp:6:
libgeoda/clustering/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/../weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
In file included from libgeoda/clustering/../DataUtils.h:19,
                 from libgeoda/clustering/azp.h:36,
                 from libgeoda/clustering/maxp_wrapper.cpp:9:
libgeoda/clustering/../GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:7:32: warning: ‘GdaConst::gda_user_seed’ defined but not used [-Wunused-variable]
    7 |     static unsigned long long  gda_user_seed = 123456789;
      |                                ^~~~~~~~~~~~~
In file included from libgeoda/clustering/maxp_wrapper.cpp:8:
libgeoda/clustering/cluster.h:41:12: warning: ‘reset_random’ defined but not used [-Wunused-variable]
   41 | static int reset_random = 0;
      |            ^~~~~~~~~~~~
libgeoda/clustering/cluster.h:40:12: warning: ‘random_state’ defined but not used [-Wunused-variable]
   40 | static int random_state = -1;
      |            ^~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/azp_wrapper.cpp -o libgeoda/clustering/azp_wrapper.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/clustering/azp_wrapper.cpp:5:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/clustering/../weights/GalWeight.h:7,
                 from libgeoda/clustering/azp_wrapper.cpp:6:
libgeoda/clustering/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/../weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
In file included from libgeoda/clustering/../DataUtils.h:19,
                 from libgeoda/clustering/azp.h:36,
                 from libgeoda/clustering/azp_wrapper.cpp:9:
libgeoda/clustering/../GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:7:32: warning: ‘GdaConst::gda_user_seed’ defined but not used [-Wunused-variable]
    7 |     static unsigned long long  gda_user_seed = 123456789;
      |                                ^~~~~~~~~~~~~
In file included from libgeoda/clustering/azp_wrapper.cpp:8:
libgeoda/clustering/cluster.h:41:12: warning: ‘reset_random’ defined but not used [-Wunused-variable]
   41 | static int reset_random = 0;
      |            ^~~~~~~~~~~~
libgeoda/clustering/cluster.h:40:12: warning: ‘random_state’ defined but not used [-Wunused-variable]
   40 | static int random_state = -1;
      |            ^~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/schc_wrapper.cpp -o libgeoda/clustering/schc_wrapper.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string.hpp:23,
                 from libgeoda/clustering/schc_wrapper.cpp:5:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_base.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:14:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/clustering/.././weights/GalWeight.h:7,
                 from libgeoda/clustering/../DataUtils.h:20,
                 from libgeoda/clustering/schc_wrapper.cpp:7:
libgeoda/clustering/.././weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/.././weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
                 from libgeoda/clustering/redcap.h:31,
                 from libgeoda/clustering/schc_wrapper.cpp:9:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   75 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:27:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  326 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/clustering/schc_wrapper.cpp:10:
libgeoda/clustering/fastcluster.h: In member function ‘void fastcluster::python_dissimilarity::nbool_correspond_tfft(t_index, t_index) const’:
libgeoda/clustering/fastcluster.h:912:38: warning: ‘~’ on an expression of type ‘bool’ [-Wbool-operation]
  912 |                 NTF += (Xb(i,k) & ~Xb(j,k)) ;
      |                                    ~~^~~~~
libgeoda/clustering/fastcluster.h:912:38: note: did you mean to use logical not (‘!’)?
libgeoda/clustering/schc_wrapper.cpp: In constructor ‘schc_wrapper::schc_wrapper(unsigned int, GeoDaWeight*, const std::vector<std::vector<double> >&, unsigned int, const std::string&, const std::vector<double>&, double, double**)’:
libgeoda/clustering/schc_wrapper.cpp:98:32: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<SpanningTreeClustering::Edge*>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   98 |                 for (int i=0; i<redcap->ordered_edges.size(); ++i) {
      |                               ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/schc_wrapper.cpp:134:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  134 |                 for (int i=0; i < clusters.size(); i++) {
      |                               ~~^~~~~~~~~~~~~~~~~
libgeoda/clustering/schc_wrapper.cpp:121:24: warning: unused variable ‘cut_distance’ [-Wunused-variable]
  121 |                 double cut_distance = cuttree (num_obs, htree, k, clusterid);
      |                        ^~~~~~~~~~~~
In file included from libgeoda/clustering/schc_wrapper.cpp:8:
libgeoda/clustering/cluster.h: At global scope:
libgeoda/clustering/cluster.h:41:12: warning: ‘reset_random’ defined but not used [-Wunused-variable]
   41 | static int reset_random = 0;
      |            ^~~~~~~~~~~~
libgeoda/clustering/cluster.h:40:12: warning: ‘random_state’ defined but not used [-Wunused-variable]
   40 | static int random_state = -1;
      |            ^~~~~~~~~~~~
In file included from libgeoda/clustering/../DataUtils.h:19:
libgeoda/clustering/../GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:7:32: warning: ‘GdaConst::gda_user_seed’ defined but not used [-Wunused-variable]
    7 |     static unsigned long long  gda_user_seed = 123456789;
      |                                ^~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/cluster.cpp -o libgeoda/clustering/cluster.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/joincount_ratio.cpp -o libgeoda/clustering/joincount_ratio.o
libgeoda/clustering/joincount_ratio.cpp: In function ‘std::vector<JoinCountRatio> joincount_ratio(const std::vector<int>&, GeoDaWeight*)’:
libgeoda/clustering/joincount_ratio.cpp:48:17: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   48 |     if (num_obs != clusters.size()) return result;
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/make_spatial.cpp -o libgeoda/clustering/make_spatial.o
libgeoda/clustering/make_spatial.cpp: In constructor ‘MakeSpatial::MakeSpatial(int, const std::vector<std::vector<int> >&, GeoDaWeight*)’:
libgeoda/clustering/make_spatial.cpp:259:29: warning: comparison of integer expressions of different signedness: ‘std::map<int, int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  259 |     if (cluster_dict.size() != num_obs) {
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/clustering/spatial_validation.cpp -o libgeoda/clustering/spatial_validation.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/cstdfloat.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/float128_functions.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/fpclassify.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/default_ops.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/number.hpp:12,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_int.hpp:19,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/cpp_bin_float.hpp:15,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/coordinate_promotion.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/core/radian_access.hpp:28,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:50,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry.hpp:17,
                 from libgeoda/clustering/spatial_validation.cpp:9:
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:714:16: warning: non-standard suffix on floating constant [-Wpedantic]
  714 |                else if (x == BOOST_FLOAT128_C(0.0))
      |                ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:717:16: warning: non-standard suffix on floating constant [-Wpedantic]
  717 |                if (::BOOST_CSTDFLOAT_FLOAT128_FABS(x) < BOOST_CSTDFLOAT_FLOAT128_MIN)
      |                ^~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/ANN.cpp -o libgeoda/knn/ANN.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/mem_fn.hpp:22,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function/function_template.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/function.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/find_iterator.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/iter_find.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/algorithm/string/split.hpp:16,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/io/svg/svg_mapper.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:129:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
      |                                        ^~~~~~~~
In file included from /usr/include/c++/15/memory:80,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/allocator_constructed.hpp:13,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/implementation.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/detail/map.hpp:8,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered/unordered_map.hpp:18,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/unordered_map.hpp:17,
                 from libgeoda/clustering/spatial_validation.cpp:8:
/usr/include/c++/15/bits/unique_ptr.h:59:28: note: declared here
   59 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from libgeoda/clustering/spatial_validation.cpp:14:
libgeoda/clustering/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from libgeoda/clustering/../weights/GwtWeight.h:6,
                 from libgeoda/clustering/../SpatialIndAlgs.h:10,
                 from libgeoda/clustering/spatial_validation.cpp:16:
libgeoda/clustering/../weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
libgeoda/clustering/../weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
libgeoda/clustering/../weights/GwtWeight.h:50:7: note:   by ‘GwtWeight& GwtWeight::operator=(const GwtWeight&)’
   50 | class GwtWeight : public GeoDaWeight {
      |       ^~~~~~~~~
libgeoda/clustering/spatial_validation.cpp: In constructor ‘SpatialValidation::SpatialValidation(int, const std::vector<std::vector<int> >&, GeoDaWeight*, std::vector<gda::GeometryContent*>&, gda::ShapeType)’:
libgeoda/clustering/spatial_validation.cpp:492:29: warning: comparison of integer expressions of different signedness: ‘std::map<int, int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  492 |     if (cluster_dict.size() != num_obs) {
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/requires.hpp:8,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:54:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:415:70:   required from here
  415 |                 bg::model::polygon<bg::model::d2::point_xy<double> > poly;
      |                                                                      ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:25,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:27:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:415:70:   required from here
  415 |                 bg::model::polygon<bg::model::d2::point_xy<double> > poly;
      |                                                                      ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::d2::point_xy<double>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5:   required from ‘class boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Point<boost::geometry::model::d2::point_xy<double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5:   required from ‘class boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:415:70:   required from here
  415 |                 bg::model::polygon<bg::model::d2::point_xy<double> > poly;
      |                                                                      ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Point<Geometry>::~Point() [with Geometry = boost::geometry::model::d2::point_xy<double>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   74 |     BOOST_CONCEPT_USAGE(Point)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:108:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:108:5:   required from ‘class boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::d2::point_xy<double>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:114:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:152:13:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:152:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:191:13:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:191:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:218:14:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:218:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:239:14:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:239:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘class boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:109:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size_type.hpp:20,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:21,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:24,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:29,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/assign.hpp:27,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/policies/relate/intersection_points.hpp:21,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/policies/relate/intersection_policy.hpp:21,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/intersection_strategies.hpp:20,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/strategies.hpp:37,
                 from /data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometry.hpp:57:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5:   required from ‘class boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:109:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:109:5:   required from ‘class boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstRing<Geometry>::~ConstRing() [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   78 |     BOOST_CONCEPT_USAGE(ConstRing)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPolygon<PolygonType>::~ConstPolygon() [with PolygonType = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPolygon)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:60:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:60:5:   required from ‘class boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Ring<Geometry>::~Ring() [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(Ring)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5:   required from ‘class boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Polygon<PolygonType>::~Polygon() [with PolygonType = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   83 |     BOOST_CONCEPT_USAGE(Polygon)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPoint<boost::geometry::model::d2::point_xy<double> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPoint<Geometry>::~ConstPoint() [with Geometry = boost::geometry::model::d2::point_xy<double>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::d2::point_xy<double>*, std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5:   required from ‘class boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstRing<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstRing<Geometry>::~ConstRing() [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   78 |     BOOST_CONCEPT_USAGE(ConstRing)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5:   required from ‘class boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstPolygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:315:36:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  315 |     concepts::check<Geometry const>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstPolygon<PolygonType>::~ConstPolygon() [with PolygonType = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  128 |     BOOST_CONCEPT_USAGE(ConstPolygon)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5:   required from ‘class boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/calculate_sum.hpp:51:29:   required from ‘static ReturnType boost::geometry::detail::calculate_polygon_sum::apply(const Polygon&, const Strategy&) [with ReturnType = double; Policy = boost::geometry::detail::area::ring_area; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::strategies::area::cartesian<>]’
   51 |         return Policy::apply(exterior_ring(poly), strategy)
      |                ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:170:14:   required from ‘static auto boost::geometry::dispatch::area<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  166 |         return calculate_polygon_sum::apply
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             <
      |             ~ 
  168 |                 typename area_result<Polygon, Strategy>::type,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |                 detail::area::ring_area
      |                 ~~~~~~~~~~~~~~~~~~~~~~~
  170 |             >(polygon, strategy);
      |             ~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:236:47:   required from ‘static auto boost::geometry::resolve_strategy::area<boost::geometry::default_strategy, false>::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  236 |         return dispatch::area<Geometry>::apply(geometry, strategy_type());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:253:55:   required from ‘static auto boost::geometry::resolve_dynamic::area<Geometry, Tag>::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::polygon_tag]’
  253 |         return resolve_strategy::area<Strategy>::apply(geometry, strategy);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:319:50:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  319 |     return resolve_dynamic::area<Geometry>::apply(geometry, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:90:9:   required from ‘static typename boost::geometry::detail::area::area_result<Ring, Strategies>::type boost::geometry::detail::area::ring_area::apply(const Ring&, const Strategies&) [with Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Strategies = boost::geometry::strategies::area::cartesian<>; typename boost::geometry::detail::area::area_result<Ring, Strategies>::type = double]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/calculate_sum.hpp:51:29:   required from ‘static ReturnType boost::geometry::detail::calculate_polygon_sum::apply(const Polygon&, const Strategy&) [with ReturnType = double; Policy = boost::geometry::detail::area::ring_area; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::strategies::area::cartesian<>]’
   51 |         return Policy::apply(exterior_ring(poly), strategy)
      |                ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:170:14:   required from ‘static auto boost::geometry::dispatch::area<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  166 |         return calculate_polygon_sum::apply
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             <
      |             ~ 
  168 |                 typename area_result<Polygon, Strategy>::type,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |                 detail::area::ring_area
      |                 ~~~~~~~~~~~~~~~~~~~~~~~
  170 |             >(polygon, strategy);
      |             ~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:236:47:   required from ‘static auto boost::geometry::resolve_strategy::area<boost::geometry::default_strategy, false>::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  236 |         return dispatch::area<Geometry>::apply(geometry, strategy_type());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:253:55:   required from ‘static auto boost::geometry::resolve_dynamic::area<Geometry, Tag>::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::polygon_tag]’
  253 |         return resolve_strategy::area<Strategy>::apply(geometry, strategy);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:319:50:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  319 |     return resolve_dynamic::area<Geometry>::apply(geometry, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::AreaStrategy<Geometry, Strategy>::~AreaStrategy() [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Strategy = boost::geometry::strategy::area::cartesian<>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   67 |     BOOST_CONCEPT_USAGE(AreaStrategy)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::multi_point<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:439:23:   required from here
  439 |             bg::append(bg_points, bg::model::d2::point_xy<double>(p->x, p->y));
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘class boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::multi_point<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:439:23:   required from here
  439 |             bg::append(bg_points, bg::model::d2::point_xy<double>(p->x, p->y));
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::multi_point<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:439:23:   required from here
  439 |             bg::append(bg_points, bg::model::d2::point_xy<double>(p->x, p->y));
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::multi_point<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:439:23:   required from here
  439 |             bg::append(bg_points, bg::model::d2::point_xy<double>(p->x, p->y));
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::MultiPoint<Geometry>::~MultiPoint() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(MultiPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Ring<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Ring<Geometry>::~Ring() [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(Ring)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5:   required from ‘class boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::Polygon<boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::Polygon<PolygonType>::~Polygon() [with PolygonType = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   83 |     BOOST_CONCEPT_USAGE(Polygon)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5:   required from ‘class boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::AreaStrategy<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/calculate_sum.hpp:51:29:   required from ‘static ReturnType boost::geometry::detail::calculate_polygon_sum::apply(const Polygon&, const Strategy&) [with ReturnType = double; Policy = boost::geometry::detail::area::ring_area; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::strategies::area::cartesian<>]’
   51 |         return Policy::apply(exterior_ring(poly), strategy)
      |                ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:170:14:   required from ‘static auto boost::geometry::dispatch::area<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  166 |         return calculate_polygon_sum::apply
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             <
      |             ~ 
  168 |                 typename area_result<Polygon, Strategy>::type,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |                 detail::area::ring_area
      |                 ~~~~~~~~~~~~~~~~~~~~~~~
  170 |             >(polygon, strategy);
      |             ~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:236:47:   required from ‘static auto boost::geometry::resolve_strategy::area<boost::geometry::default_strategy, false>::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  236 |         return dispatch::area<Geometry>::apply(geometry, strategy_type());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:253:55:   required from ‘static auto boost::geometry::resolve_dynamic::area<Geometry, Tag>::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::polygon_tag]’
  253 |         return resolve_strategy::area<Strategy>::apply(geometry, strategy);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:319:50:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  319 |     return resolve_dynamic::area<Geometry>::apply(geometry, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::AreaStrategy<Geometry, Strategy>::~AreaStrategy() [with Geometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Strategy = boost::geometry::strategy::area::cartesian<>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   67 |     BOOST_CONCEPT_USAGE(AreaStrategy)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring<geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:99:24:   required from ‘static typename boost::geometry::detail::area::area_result<Ring, Strategies>::type boost::geometry::detail::area::ring_area::apply(const Ring&, const Strategies&) [with Ring = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Strategies = boost::geometry::strategies::area::cartesian<>; typename boost::geometry::detail::area::area_result<Ring, Strategies>::type = double]’
   99 |         if (boost::size(ring) < detail::minimum_ring_size<Ring>::value)
      |             ~~~~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/calculate_sum.hpp:51:29:   required from ‘static ReturnType boost::geometry::detail::calculate_polygon_sum::apply(const Polygon&, const Strategy&) [with ReturnType = double; Policy = boost::geometry::detail::area::ring_area; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::strategies::area::cartesian<>]’
   51 |         return Policy::apply(exterior_ring(poly), strategy)
      |                ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:170:14:   required from ‘static auto boost::geometry::dispatch::area<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  166 |         return calculate_polygon_sum::apply
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  167 |             <
      |             ~ 
  168 |                 typename area_result<Polygon, Strategy>::type,
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  169 |                 detail::area::ring_area
      |                 ~~~~~~~~~~~~~~~~~~~~~~~
  170 |             >(polygon, strategy);
      |             ~^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:236:47:   required from ‘static auto boost::geometry::resolve_strategy::area<boost::geometry::default_strategy, false>::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  236 |         return dispatch::area<Geometry>::apply(geometry, strategy_type());
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:253:55:   required from ‘static auto boost::geometry::resolve_dynamic::area<Geometry, Tag>::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::polygon_tag]’
  253 |         return resolve_strategy::area<Strategy>::apply(geometry, strategy);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/area.hpp:319:50:   required from ‘auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >]’
  319 |     return resolve_dynamic::area<Geometry>::apply(geometry, default_strategy());
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:423:47:   required from here
  423 |                 double element_area = bg::area(poly);
      |                                       ~~~~~~~~^~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::multi_point<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:439:23:   required from here
  439 |             bg::append(bg_points, bg::model::d2::point_xy<double>(p->x, p->y));
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:48:5:   required from ‘class boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::MultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:272:30:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::multi_point<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  272 |     concepts::check<Geometry>();
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~^~
libgeoda/clustering/spatial_validation.cpp:439:23:   required from here
  439 |             bg::append(bg_points, bg::model::d2::point_xy<double>(p->x, p->y));
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::MultiPoint<Geometry>::~MultiPoint() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:48:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   48 |     BOOST_CONCEPT_USAGE(MultiPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:373:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:374:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:374:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>::~RandomAccessRangeConcept()’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  125 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  136 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  147 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  158 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  318 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  352 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:370:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>’
  370 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
  181 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  197 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  224 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:95:5:   required from ‘typename boost::range_iterator<T>::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator<T>::type = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/util/range.hpp:110:16:   required from ‘typename boost::range_reference<T>::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size<RandomAccessRange>::type) [with RandomAccessRange = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >&; typename boost::range_reference<T>::type = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>&; typename boost::range_size<RandomAccessRange>::type = long unsigned int]’
  110 |     return *pos(rng, i);
      |             ~~~^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:104:62:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  104 |             to_range_point::apply<ring_type, Point>(range::at(int_rings, ring_index), point);
      |                                                     ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>*, std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  245 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:76:5:   required from ‘class boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/is_empty.hpp:158:40:   required from ‘static bool boost::geometry::resolve_dynamic::is_empty<Geometry, Tag>::apply(const Geometry&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  158 |         concepts::check<Geometry const>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/is_empty.hpp:208:54:   required from ‘bool boost::geometry::is_empty(const Geometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >]’
  208 |     return resolve_dynamic::is_empty<Geometry>::apply(geometry);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:588:27:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&, const Strategy&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >; Strategy = default_strategy]’
  588 |     if (geometry::is_empty(geometry))
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:612:26:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >]’
  612 |     geometry::convex_hull(geometry, hull, default_strategy());
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:442:24:   required from here
  442 |         bg::convex_hull(bg_points, bg_hull);
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/is_empty.hpp:158:40:   required from ‘static bool boost::geometry::resolve_dynamic::is_empty<Geometry, Tag>::apply(const Geometry&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  158 |         concepts::check<Geometry const>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/is_empty.hpp:208:54:   required from ‘bool boost::geometry::is_empty(const Geometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >]’
  208 |     return resolve_dynamic::is_empty<Geometry>::apply(geometry);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:588:27:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&, const Strategy&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >; Strategy = default_strategy]’
  588 |     if (geometry::is_empty(geometry))
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:612:26:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >]’
  612 |     geometry::convex_hull(geometry, hull, default_strategy());
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:442:24:   required from here
  442 |         bg::convex_hull(bg_points, bg_hull);
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstMultiPoint<Geometry>::~ConstMultiPoint() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:76:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   76 |     BOOST_CONCEPT_USAGE(ConstMultiPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:61:27:   required from ‘static std::size_t boost::geometry::dispatch::num_interior_rings<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; std::size_t = long unsigned int]’
   61 |         return boost::size(geometry::interior_rings(polygon));
      |                ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:93:61:   required from ‘static std::size_t boost::geometry::resolve_variant::num_interior_rings<Geometry>::apply(const Geometry&) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; std::size_t = long unsigned int]’
   93 |         return dispatch::num_interior_rings<Geometry>::apply(geometry);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:135:64:   required from ‘std::size_t boost::geometry::num_interior_rings(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >; std::size_t = long unsigned int]’
  135 |     return resolve_variant::num_interior_rings<Geometry>::apply(geometry);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:101:66:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  101 |         else if (ring_index < signed_size_type(num_interior_rings(polygon)))
      |                                                ~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<geometry::model::ring<geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<geometry::model::ring<geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:61:27:   required from ‘static std::size_t boost::geometry::dispatch::num_interior_rings<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; std::size_t = long unsigned int]’
   61 |         return boost::size(geometry::interior_rings(polygon));
      |                ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:93:61:   required from ‘static std::size_t boost::geometry::resolve_variant::num_interior_rings<Geometry>::apply(const Geometry&) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; std::size_t = long unsigned int]’
   93 |         return dispatch::num_interior_rings<Geometry>::apply(geometry);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:135:64:   required from ‘std::size_t boost::geometry::num_interior_rings(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >; std::size_t = long unsigned int]’
  135 |     return resolve_variant::num_interior_rings<Geometry>::apply(geometry);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:101:66:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  101 |         else if (ring_index < signed_size_type(num_interior_rings(polygon)))
      |                                                ~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:76:5:   required from ‘class boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::geometry::concepts::ConstMultiPoint<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5:   required from ‘constexpr void boost::geometry::concepts::check() [with Geometry = const boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/is_empty.hpp:158:40:   required from ‘static bool boost::geometry::resolve_dynamic::is_empty<Geometry, Tag>::apply(const Geometry&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  158 |         concepts::check<Geometry const>();
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/is_empty.hpp:208:54:   required from ‘bool boost::geometry::is_empty(const Geometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >]’
  208 |     return resolve_dynamic::is_empty<Geometry>::apply(geometry);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:588:27:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&, const Strategy&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >; Strategy = default_strategy]’
  588 |     if (geometry::is_empty(geometry))
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:612:26:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >]’
  612 |     geometry::convex_hull(geometry, hull, default_strategy());
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:442:24:   required from here
  442 |         bg::convex_hull(bg_points, bg_hull);
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::geometry::concepts::ConstMultiPoint<Geometry>::~ConstMultiPoint() [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:76:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   76 |     BOOST_CONCEPT_USAGE(ConstMultiPoint)
      |     ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:61:27:   required from ‘static std::size_t boost::geometry::dispatch::num_interior_rings<Polygon, boost::geometry::polygon_tag>::apply(const Polygon&) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; std::size_t = long unsigned int]’
   61 |         return boost::size(geometry::interior_rings(polygon));
      |                ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:93:61:   required from ‘static std::size_t boost::geometry::resolve_variant::num_interior_rings<Geometry>::apply(const Geometry&) [with Geometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; std::size_t = long unsigned int]’
   93 |         return dispatch::num_interior_rings<Geometry>::apply(geometry);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:135:64:   required from ‘std::size_t boost::geometry::num_interior_rings(const Geometry&) [with Geometry = model::polygon<model::d2::point_xy<double> >; std::size_t = long unsigned int]’
  135 |     return resolve_variant::num_interior_rings<Geometry>::apply(geometry);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:101:66:   required from ‘static void boost::geometry::detail::append::to_polygon_point::apply(Polygon&, const Point&, boost::geometry::signed_size_type, boost::geometry::signed_size_type) [with Polygon = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Point = boost::geometry::model::d2::point_xy<double>; boost::geometry::signed_size_type = long int]’
  101 |         else if (ring_index < signed_size_type(num_interior_rings(polygon)))
      |                                                ~~~~~~~~~~~~~~~~~~^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/append.hpp:277:17:   required from ‘void boost::geometry::append(Geometry&, const RangeOrPoint&, signed_size_type, signed_size_type) [with Geometry = model::polygon<model::d2::point_xy<double> >; RangeOrPoint = model::d2::point_xy<double>; signed_size_type = long int]’
  274 |     dispatch::append
      |     ~~~~~~~~~~~~~~~~
  275 |         <
      |         ~        
  276 |             Geometry, RangeOrPoint
      |             ~~~~~~~~~~~~~~~~~~~~~~
  277 |         >::apply(geometry, range_or_point, ring_index, multi_index);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:421:31:   required from here
  421 |                     bg::append(poly, bg::model::d2::point_xy<double>(x, y));
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>, std::allocator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:334:47:   required from ‘static void boost::geometry::dispatch::convex_hull_out<OutputGeometry, boost::geometry::polygon_tag>::apply(const Geometry&, OutputGeometry&, const Strategies&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Strategies = boost::geometry::strategies::convex_hull::cartesian<>; OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  334 |         dispatch::convex_hull<Geometry>::apply(geometry, ring, strategies);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:524:57:   required from ‘static void boost::geometry::resolve_strategy::convex_hull<boost::geometry::default_strategy>::apply(const Geometry&, OutputGeometry&, const boost::geometry::default_strategy&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  524 |         dispatch::convex_hull_out<OutputGeometry>::apply(geometry, out, strategy_type());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:547:55:   required from ‘static void boost::geometry::resolve_dynamic::convex_hull<Geometry, Tag>::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  547 |         resolve_strategy::convex_hull<Strategy>::apply(geometry, out, strategy);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:594:50:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&, const Strategy&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >; Strategy = default_strategy]’
  594 |     resolve_dynamic::convex_hull<Geometry>::apply(geometry, out, strategy);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:612:26:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >]’
  612 |     geometry::convex_hull(geometry, hull, default_strategy());
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:442:24:   required from here
  442 |         bg::convex_hull(bg_points, bg_hull);
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9:   required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector<geometry::model::d2::point_xy<double>, std::allocator<geometry::model::d2::point_xy<double> > >; typename range_size<const SinglePassRange>::type = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/graham_andrew.hpp:294:44:   required from ‘static void boost::geometry::detail::convex_hull::graham_andrew<InputPoint>::output_ranges(const container_type&, const container_type&, OutputIterator, bool) [with OutputIterator = boost::geometry::range::back_insert_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >; InputPoint = boost::geometry::model::d2::point_xy<double>; container_type = std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > >]’
  294 |         size_type const count = boost::size(first) + boost::size(second) - 1;
      |                                 ~~~~~~~~~~~^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/graham_andrew.hpp:272:26:   required from ‘static void boost::geometry::detail::convex_hull::graham_andrew<InputPoint>::result(const partitions&, OutputIterator, bool, bool) [with OutputIterator = boost::geometry::range::back_insert_iterator<boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator> >; InputPoint = boost::geometry::model::d2::point_xy<double>]’
  272 |             output_ranges(state.m_upper_hull, state.m_lower_hull, out, closed);
      |             ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/graham_andrew.hpp:171:15:   required from ‘static void boost::geometry::detail::convex_hull::graham_andrew<InputPoint>::apply(const InputProxy&, OutputRing&, Strategy&) [with InputProxy = boost::geometry::detail::convex_hull::input_geometry_proxy<boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> > >; OutputRing = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Strategy = const boost::geometry::strategies::convex_hull::cartesian<>; InputPoint = boost::geometry::model::d2::point_xy<double>]’
  171 |         result(state,
      |         ~~~~~~^~~~~~~
  172 |                range::back_inserter(out_ring),
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  173 |                geometry::point_order<OutputRing>::value == clockwise,
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  174 |                geometry::closure<OutputRing>::value != open);
      |                ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:217:21:   required from ‘static void boost::geometry::dispatch::convex_hull<Geometry, Tag>::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::ring<boost::geometry::model::d2::point_xy<double>, true, true, std::vector, std::allocator>; Strategy = boost::geometry::strategies::convex_hull::cartesian<>; Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  214 |         detail::convex_hull::graham_andrew
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  215 |             <
      |             ~        
  216 |                 point_type_t<Geometry>
      |                 ~~~~~~~~~~~~~~~~~~~~~~
  217 |             >::apply(in_proxy, out, strategy);
      |             ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:334:47:   required from ‘static void boost::geometry::dispatch::convex_hull_out<OutputGeometry, boost::geometry::polygon_tag>::apply(const Geometry&, OutputGeometry&, const Strategies&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Strategies = boost::geometry::strategies::convex_hull::cartesian<>; OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  334 |         dispatch::convex_hull<Geometry>::apply(geometry, ring, strategies);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:524:57:   required from ‘static void boost::geometry::resolve_strategy::convex_hull<boost::geometry::default_strategy>::apply(const Geometry&, OutputGeometry&, const boost::geometry::default_strategy&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  524 |         dispatch::convex_hull_out<OutputGeometry>::apply(geometry, out, strategy_type());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:547:55:   required from ‘static void boost::geometry::resolve_dynamic::convex_hull<Geometry, Tag>::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  547 |         resolve_strategy::convex_hull<Strategy>::apply(geometry, out, strategy);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:594:50:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&, const Strategy&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >; Strategy = default_strategy]’
  594 |     resolve_dynamic::convex_hull<Geometry>::apply(geometry, out, strategy);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:612:26:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >]’
  612 |     geometry::convex_hull(geometry, hull, default_strategy());
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:442:24:   required from here
  442 |         bg::convex_hull(bg_points, bg_hull);
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:334:47:   required from ‘static void boost::geometry::dispatch::convex_hull_out<OutputGeometry, boost::geometry::polygon_tag>::apply(const Geometry&, OutputGeometry&, const Strategies&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Strategies = boost::geometry::strategies::convex_hull::cartesian<>; OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  334 |         dispatch::convex_hull<Geometry>::apply(geometry, ring, strategies);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:524:57:   required from ‘static void boost::geometry::resolve_strategy::convex_hull<boost::geometry::default_strategy>::apply(const Geometry&, OutputGeometry&, const boost::geometry::default_strategy&) [with Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >]’
  524 |         dispatch::convex_hull_out<OutputGeometry>::apply(geometry, out, strategy_type());
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:547:55:   required from ‘static void boost::geometry::resolve_dynamic::convex_hull<Geometry, Tag>::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> >; Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::multi_point<boost::geometry::model::d2::point_xy<double> >; Tag = boost::geometry::multi_point_tag]’
  547 |         resolve_strategy::convex_hull<Strategy>::apply(geometry, out, strategy);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:594:50:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&, const Strategy&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >; Strategy = default_strategy]’
  594 |     resolve_dynamic::convex_hull<Geometry>::apply(geometry, out, strategy);
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:612:26:   required from ‘void boost::geometry::convex_hull(const Geometry&, OutputGeometry&) [with Geometry = model::multi_point<model::d2::point_xy<double> >; OutputGeometry = model::polygon<model::d2::point_xy<double> >]’
  612 |     geometry::convex_hull(geometry, hull, default_strategy());
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
libgeoda/clustering/spatial_validation.cpp:442:24:   required from here
  442 |         bg::convex_hull(bg_points, bg_hull);
      |         ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<boost::geometry::model::d2::point_xy<double>, std::allocator<boost::geometry::model::d2::point_xy<double> > >]’
   37 |       ~model()
      |       ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  284 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
In file included from libgeoda/clustering/spatial_validation.cpp:13:
libgeoda/clustering/../GdaConst.h: At global scope:
libgeoda/clustering/../GdaConst.h:9:19: warning: ‘GdaConst::gda_eigen_tol’ defined but not used [-Wunused-variable]
    9 |     static double gda_eigen_tol = 0.00000001;
      |                   ^~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:8:17: warning: ‘GdaConst::use_gda_user_seed’ defined but not used [-Wunused-variable]
    8 |     static bool use_gda_user_seed = true;
      |                 ^~~~~~~~~~~~~~~~~
libgeoda/clustering/../GdaConst.h:7:32: warning: ‘GdaConst::gda_user_seed’ defined but not used [-Wunused-variable]
    7 |     static unsigned long long  gda_user_seed = 123456789;
      |                                ^~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/perf.cpp -o libgeoda/knn/perf.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_util.cpp -o libgeoda/knn/kd_util.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_tree.cpp -o libgeoda/knn/kd_tree.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_split.cpp -o libgeoda/knn/kd_split.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_search.cpp -o libgeoda/knn/kd_search.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_pr_search.cpp -o libgeoda/knn/kd_pr_search.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_fix_rad_search.cpp -o libgeoda/knn/kd_fix_rad_search.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/kd_dump.cpp -o libgeoda/knn/kd_dump.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/brute.cpp -o libgeoda/knn/brute.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/bd_tree.cpp -o libgeoda/knn/bd_tree.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/bd_search.cpp -o libgeoda/knn/bd_search.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/bd_pr_search.cpp -o libgeoda/knn/bd_pr_search.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 libgeoda/knn/bd_fix_rad_search.cpp -o libgeoda/knn/bd_fix_rad_search.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 rcpp_rgeoda.cpp -o rcpp_rgeoda.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 rcpp_weights.cpp -o rcpp_weights.o
In file included from rcpp_weights.cpp:9:
libgeoda/weights/GeodaWeight.h:53:32: warning: ‘virtual const GeoDaWeight& GeoDaWeight::operator=(const GeoDaWeight&)’ was hidden [-Woverloaded-virtual=]
   53 |     virtual const GeoDaWeight& operator=(const GeoDaWeight& gw);
      |                                ^~~~~~~~
In file included from rcpp_weights.cpp:10:
libgeoda/weights/GalWeight.h:57:28: note:   by ‘virtual GalWeight& GalWeight::operator=(const GalWeight&)’
   57 |         virtual GalWeight& operator=(const GalWeight& gw);
      |                            ^~~~~~~~
rcpp_weights.cpp: In function ‘void p_GeoDaWeight__SetNeighbors(SEXP, int, SEXP)’:
rcpp_weights.cpp:48:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   48 |   for (int i=0; i<nbr_ids.size(); ++i) {
      |                 ~^~~~~~~~~~~~~~~
rcpp_weights.cpp:57:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   57 |   for (int i=0; i<nbr_ids.size(); ++i) {
      |                 ~^~~~~~~~~~~~~~~
rcpp_weights.cpp: In function ‘void p_GeoDaWeight__SetNeighborsAndWeights(SEXP, int, SEXP, SEXP)’:
rcpp_weights.cpp:79:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   79 |   for (int i=0; i<nbr_ids.size(); ++i) {
      |                 ~^~~~~~~~~~~~~~~
rcpp_weights.cpp:88:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   88 |   for (int i=0; i<nbr_ids.size(); ++i) {
      |                 ~^~~~~~~~~~~~~~~
rcpp_weights.cpp: In function ‘Rcpp::NumericVector p_GeoDaWeight__GetNeighbors(SEXP, int)’:
rcpp_weights.cpp:261:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  261 |   for (int i=0; i<nn.size(); ++i) {
      |                 ~^~~~~~~~~~
rcpp_weights.cpp: In function ‘Rcpp::DoubleVector p_GeoDaWeight__GetNeighborWeights(SEXP, int)’:
rcpp_weights.cpp:280:18: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  280 |   for (int i=0; i<nnw.size(); ++i) {
      |                 ~^~~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 rcpp_utils.cpp -o rcpp_utils.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 rcpp_lisa.cpp -o rcpp_lisa.o
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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 rcpp_clustering.cpp -o rcpp_clustering.o
rcpp_clustering.cpp: In function ‘Rcpp::List p_maxp_greedy(SEXP, Rcpp::List&, int, Rcpp::NumericVector&, double, int, Rcpp::NumericVector&, std::string, std::string, int, int, Rcpp::NumericVector&)’:
rcpp_clustering.cpp:173:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  173 |   if (raw_bound.size() == num_obs) {
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~
rcpp_clustering.cpp: In function ‘Rcpp::List p_maxp_sa(SEXP, Rcpp::List&, int, Rcpp::NumericVector&, double, int, double, int, Rcpp::NumericVector&, std::string, std::string, int, int, Rcpp::NumericVector&)’:
rcpp_clustering.cpp:208:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  208 |   if (raw_bound.size() == num_obs) {
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~
rcpp_clustering.cpp: In function ‘Rcpp::List p_maxp_tabu(SEXP, Rcpp::List&, int, Rcpp::NumericVector&, double, int, int, int, Rcpp::NumericVector&, std::string, std::string, int, int, Rcpp::NumericVector&)’:
rcpp_clustering.cpp:243:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  243 |   if (raw_bound.size() == num_obs) {
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~
rcpp_clustering.cpp: In function ‘Rcpp::List p_azp_greedy(int, SEXP, Rcpp::List&, int, Rcpp::NumericVector&, double, int, Rcpp::NumericVector&, std::string, std::string, int, Rcpp::NumericVector&)’:
rcpp_clustering.cpp:278:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  278 |   if (raw_bound.size() == num_obs) {
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~
rcpp_clustering.cpp: In function ‘Rcpp::List p_azp_sa(int, SEXP, Rcpp::List&, int, double, int, Rcpp::NumericVector&, double, int, Rcpp::NumericVector&, std::string, std::string, int, Rcpp::NumericVector&)’:
rcpp_clustering.cpp:314:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  314 |   if (raw_bound.size() == num_obs) {
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~
rcpp_clustering.cpp: In function ‘Rcpp::List p_azp_tabu(int, SEXP, Rcpp::List&, int, int, int, Rcpp::NumericVector&, double, int, Rcpp::NumericVector&, std::string, std::string, int, Rcpp::NumericVector&)’:
rcpp_clustering.cpp:350:24: warning: comparison of integer expressions of different signedness: ‘std::vector<double>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
  350 |   if (raw_bound.size() == num_obs) {
      |       ~~~~~~~~~~~~~~~~~^~~~~~~~~~
g++ -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/BH/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
g++ -std=gnu++17 -shared -L/usr/local/lib64 -o rgeoda.so ./libgeoda/libgeoda.o ./libgeoda/gda_sa.o ./libgeoda/gda_data.o ./libgeoda/gda_weights.o ./libgeoda/gda_clustering.o ./libgeoda/GenGeomAlgs.o ./libgeoda/GenUtils.o ./libgeoda/SpatialIndAlgs.o ./libgeoda/pg/geoms.o ./libgeoda/pg/utils.o ./libgeoda/shapelib/dbfopen.o ./libgeoda/shapelib/safileio.o ./libgeoda/shapelib/shpopen.o ./libgeoda/weights/PointsToContigWeights.o ./libgeoda/weights/PolysToContigWeights.o ./libgeoda/weights/GalWeight.o ./libgeoda/weights/GwtWeight.o ./libgeoda/weights/GeodaWeight.o ./libgeoda/weights/VoronoiUtils.o ./libgeoda/sa/BatchLISA.o ./libgeoda/sa/BatchLocalMoran.o ./libgeoda/sa/LISA.o ./libgeoda/sa/MultiGeary.o ./libgeoda/sa/MultiJoinCount.o ./libgeoda/sa/UniG.o ./libgeoda/sa/UniGeary.o ./libgeoda/sa/UniGstar.o ./libgeoda/sa/UniJoinCount.o ./libgeoda/sa/UniLocalMoran.o ./libgeoda/sa/BiLocalMoran.o ./libgeoda/clustering/fastcluster.o ./libgeoda/clustering/redcap.o ./libgeoda/clustering/redcap_wrapper.o ./libgeoda/clustering/azp.o ./libgeoda/clustering/maxp_wrapper.o ./libgeoda/clustering/azp_wrapper.o ./libgeoda/clustering/schc_wrapper.o ./libgeoda/clustering/cluster.o ./libgeoda/clustering/joincount_ratio.o ./libgeoda/clustering/make_spatial.o ./libgeoda/clustering/spatial_validation.o ./libgeoda/knn/ANN.o ./libgeoda/knn/perf.o ./libgeoda/knn/kd_util.o ./libgeoda/knn/kd_tree.o ./libgeoda/knn/kd_split.o ./libgeoda/knn/kd_search.o ./libgeoda/knn/kd_pr_search.o ./libgeoda/knn/kd_fix_rad_search.o ./libgeoda/knn/kd_dump.o ./libgeoda/knn/brute.o ./libgeoda/knn/bd_tree.o ./libgeoda/knn/bd_search.o ./libgeoda/knn/bd_pr_search.o ./libgeoda/knn/bd_fix_rad_search.o rcpp_rgeoda.o rcpp_weights.o rcpp_utils.o rcpp_lisa.o rcpp_clustering.o RcppExports.o -pthread
make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/rgeoda/src'
make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/rgeoda/src'
make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/rgeoda/src'
installing to /data/gannet/ripley/R/packages/tests-devel/rgeoda.Rcheck/00LOCK-rgeoda/00new/rgeoda/libs
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
** building package indices
** 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 (rgeoda)