* 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++.exe (GCC) 14.2.0' using C++17 make[1]: Entering directory '/d/temp/2025_07_15_01_50_00_18950/RtmpQxPZ7G/R.INSTALL2a47822374fc8/rgeoda/src' rm -f rgeoda.dll ./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/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 g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -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&, int, int)': libgeoda/./shape/centroid.h:155:48: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long 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::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::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1247:23: required from 'void ttmath::UInt::Mul3Big(const ttmath::UInt&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]' 1247 | Mul3Big2(table, ss2.table, result.table); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:966:4: required from 'void ttmath::UInt::MulBig(const ttmath::UInt&, 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::MulRef(const ttmath::Big&, 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::Mul(const ttmath::Big&, 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 ttmath::Big::operator*(const ttmath::Big&) 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::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::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1247:23: required from 'void ttmath::UInt::Mul3Big(const ttmath::UInt&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]' 1247 | Mul3Big2(table, ss2.table, result.table); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:966:4: required from 'void ttmath::UInt::MulBig(const ttmath::UInt&, 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::MulRef(const ttmath::Big&, 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::Mul(const ttmath::Big&, 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 ttmath::Big::operator*(const ttmath::Big&) 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::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::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1357:24: required from 'void ttmath::UInt::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(x1, y1, result+first_size*2); // z2 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1303:49: required from 'void ttmath::UInt::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1247:23: required from 'void ttmath::UInt::Mul3Big(const ttmath::UInt&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]' 1247 | Mul3Big2(table, ss2.table, result.table); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:966:4: required from 'void ttmath::UInt::MulBig(const ttmath::UInt&, 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::MulRef(const ttmath::Big&, 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::Mul(const ttmath::Big&, 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 ttmath::Big::operator*(const ttmath::Big&) 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::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::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1357:24: required from 'void ttmath::UInt::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(x1, y1, result+first_size*2); // z2 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1303:49: required from 'void ttmath::UInt::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1247:23: required from 'void ttmath::UInt::Mul3Big(const ttmath::UInt&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]' 1247 | Mul3Big2(table, ss2.table, result.table); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:966:4: required from 'void ttmath::UInt::MulBig(const ttmath::UInt&, 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::MulRef(const ttmath::Big&, 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::Mul(const ttmath::Big&, 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 ttmath::Big::operator*(const ttmath::Big&) 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::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::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1357:24: required from 'void ttmath::UInt::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(x1, y1, result+first_size*2); // z2 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1303:49: required from 'void ttmath::UInt::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1357:24: required from 'void ttmath::UInt::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(x1, y1, result+first_size*2); // z2 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1303:49: required from 'void ttmath::UInt::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1247:23: required from 'void ttmath::UInt::Mul3Big(const ttmath::UInt&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]' 1247 | Mul3Big2(table, ss2.table, result.table); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:966:4: required from 'void ttmath::UInt::MulBig(const ttmath::UInt&, 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::MulRef(const ttmath::Big&, 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::Mul(const ttmath::Big&, 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 ttmath::Big::operator*(const ttmath::Big&) 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::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::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1357:24: required from 'void ttmath::UInt::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(x1, y1, result+first_size*2); // z2 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1303:49: required from 'void ttmath::UInt::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1357:24: required from 'void ttmath::UInt::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(x1, y1, result+first_size*2); // z2 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1303:49: required from 'void ttmath::UInt::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(x1, x0, y1, y0, result); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:1247:23: required from 'void ttmath::UInt::Mul3Big(const ttmath::UInt&, ttmath::UInt<(value_size * 2)>&) [with long long unsigned int value_size = 2]' 1247 | Mul3Big2(table, ss2.table, result.table); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/./shape/ttmath/ttmathuint.h:966:4: required from 'void ttmath::UInt::MulBig(const ttmath::UInt&, 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::MulRef(const ttmath::Big&, 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::Mul(const ttmath::Big&, 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 ttmath::Big::operator*(const ttmath::Big&) 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; | ^ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/gda_sa.cpp -o libgeoda/gda_sa.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/gda_sa.cpp:3: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/gda_sa.cpp: In function 'std::vector > gda_neighbor_match_test(AbstractGeoDa*, unsigned int, double, bool, bool, bool, const std::vector >&, 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 > gda_neighbor_match_test(GeoDaWeight*, unsigned int, const std::vector >&, 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::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/gda_data.cpp: In function 'bool gda_rateSmootherEBS(const std::vector&, const std::vector&, std::vector&, std::vector&)': libgeoda/gda_data.cpp:152:24: warning: comparison of integer expressions of different signedness: 'std::vector::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare] 152 | if (results.size() != obs) { | ~~~~~~~~~~~~~~~^~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/gda_weights.cpp -o libgeoda/gda_weights.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/gda_weights.cpp:16: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/shared_ptr_base.h:59, from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/shared_ptr.h:53, from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/regex:49, from libgeoda/gda_weights.cpp:5: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/gda_weights.cpp: In function 'GeoDaWeight* gda_load_gal(const char*, const std::vector >&)': libgeoda/gda_weights.cpp:248:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector >::size_type' {aka 'long 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 >&)': libgeoda/gda_weights.cpp:400:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector >::size_type' {aka 'long 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&)': 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/gda_clustering.cpp -o libgeoda/gda_clustering.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/gda_clustering.cpp:2: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/gda_clustering.cpp: In function 'std::vector gda_makespatial(const std::vector&, GeoDaWeight*)': libgeoda/gda_clustering.cpp:456:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 456 | for (int j=0; j::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/GenUtils.cpp: In function 'std::vector GenUtils::NaturalBreaks(int, const std::vector&, std::vector&)': 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/SpatialIndAlgs.cpp -o libgeoda/SpatialIndAlgs.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/foreach.hpp:76, from libgeoda/SpatialIndAlgs.cpp:4: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23, from libgeoda/SpatialIndAlgs.cpp:6: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/SpatialIndAlgs.cpp: In function 'GwtWeight* SpatialIndAlgs::knn_build_sub(const rtree_pt_2d_t&, std::vector >&, 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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/assert.hpp:35, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size_type.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:21, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/random/hyperexponential_distribution.hpp:30, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/random.hpp:71, from libgeoda/SpatialIndAlgs.cpp:5: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box >' 92 | &::boost::concepts::requirement_::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)); | ^ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:31: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box >' 92 | &::boost::concepts::requirement_::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)); | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:410:46: required from here 410 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:410:46: required from here 410 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:1004:46: required from here 1004 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:1004:46: required from here 1004 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box >' 92 | &::boost::concepts::requirement_::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)); | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point]' 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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint >]': D:/RCompile/CRANpkg/lib/4.6/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]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point]' 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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:410:46: required from here 410 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point]' 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) | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint >]': D:/RCompile/CRANpkg/lib/4.6/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]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point]' 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) | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:1004:46: required from here 1004 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::point >; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::point >]' 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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint > >]': D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::point >; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::point >]' 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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstBox > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstBox > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:561:36: required from 'boost::geometry::wkt_manipulator boost::geometry::wkt(const Geometry&) [with Geometry = model::box >]' 561 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/SpatialIndAlgs.cpp:71:26: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstBox > >]': D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:561:36: required from 'boost::geometry::wkt_manipulator boost::geometry::wkt(const Geometry&) [with Geometry = model::box >]' 561 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/SpatialIndAlgs.cpp:71:26: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstBox::~ConstBox() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 109 | BOOST_CONCEPT_USAGE(ConstBox) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point]' 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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::point]' 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) | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::point]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::point >; Strategy = default_strategy]' 317 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::point >]' 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); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstBox > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstBox > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:561:36: required from 'boost::geometry::wkt_manipulator boost::geometry::wkt(const Geometry&) [with Geometry = model::box >]' 561 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/SpatialIndAlgs.cpp:71:26: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstBox::~ConstBox() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 109 | BOOST_CONCEPT_USAGE(ConstBox) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: required from 'class boost::geometry::concepts::Box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Box > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:98:28: required from here 98 | box_2d bnds = rtree.bounds(); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Box > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Box > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:98:28: required from here 98 | box_2d bnds = rtree.bounds(); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Box::~Box() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 62 | BOOST_CONCEPT_USAGE(Box) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: required from 'class boost::geometry::concepts::Box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Box > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; bounds_type = boost::geometry::model::box >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:410:46: required from here 410 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Box > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Box > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; bounds_type = boost::geometry::model::box >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:410:46: required from here 410 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Box::~Box() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 62 | BOOST_CONCEPT_USAGE(Box) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: required from 'class boost::geometry::concepts::Box > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Box > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box > >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:1004:46: required from here 1004 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Box > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Box > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box > >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:1004:46: required from here 1004 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Box::~Box() [with Geometry = boost::geometry::model::box > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 62 | BOOST_CONCEPT_USAGE(Box) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Box > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: required from 'class boost::geometry::concepts::Box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Box > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:98:28: required from here 98 | box_2d bnds = rtree.bounds(); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Box::~Box() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 62 | BOOST_CONCEPT_USAGE(Box) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Box > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: required from 'class boost::geometry::concepts::Box > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Box > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; bounds_type = boost::geometry::model::box >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:410:46: required from here 410 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Box::~Box() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 62 | BOOST_CONCEPT_USAGE(Box) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Box > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: required from 'class boost::geometry::concepts::Box > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Box > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::box > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:91:30: required from 'void boost::geometry::assign_inverse(Geometry&) [with Geometry = model::box > >]' 91 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1495:33: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 1495 | geometry::assign_inverse(result); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ libgeoda/SpatialIndAlgs.cpp:1004:46: required from here 1004 | rtree.qbegin(bgi::intersects(rtree.bounds())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Box::~Box() [with Geometry = boost::geometry::model::box > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:62:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 62 | BOOST_CONCEPT_USAGE(Box) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:152:13: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:152:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:281:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:281:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, false, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, false, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, false, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, false, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, false, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, false, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:130:24: required from 'static void boost::geometry::detail::wkt::wkt_range::apply(std::basic_ostream&, const Range&, bool) [with Char = char; Traits = std::char_traits; Range = boost::geometry::model::ring, 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) | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:291:49: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 291 | wkt_sequence::apply(os, ring); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:191:13: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:191:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:322:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:322:9: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:218:14: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:218:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:356:9: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:356:9: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:239:14: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:239:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:374:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:374:9: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'class boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: required from 'class boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 72 | check(); | ~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Ring::~Ring() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 48 | BOOST_CONCEPT_USAGE(Ring) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'class boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, false, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator> >::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, false, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: required from 'class boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, false, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 72 | check(); | ~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Ring::~Ring() [with Geometry = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 48 | BOOST_CONCEPT_USAGE(Ring) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstBox > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstBox > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point; Indexable = boost::geometry::model::box >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator, unsigned int> > >; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest >; size_type = long long unsigned int; node_pointer = boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator, unsigned int> > >; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest >; OutIter = std::back_insert_iterator, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest >; OutIter = std::back_insert_iterator, unsigned int> > >; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstBox > >]': D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::box >; Strategy = default_strategy]' 251 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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; Geometry2 = model::box >]' 282 | return geometry::comparable_distance(geometry1, geometry2, default_strategy()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:141:45: required from 'static boost::geometry::index::detail::comparable_distance_call::result_type boost::geometry::index::detail::comparable_distance_call::apply(const G1&, const G2&, const boost::geometry::default_strategy&) [with G1 = boost::geometry::model::point; G2 = boost::geometry::model::box >; result_type = double]' 141 | return geometry::comparable_distance(g1, g2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point; Indexable = boost::geometry::model::box >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator, unsigned int> > >; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest >; size_type = long long unsigned int; node_pointer = boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator, unsigned int> > >; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest >; OutIter = std::back_insert_iterator, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest >; OutIter = std::back_insert_iterator, unsigned int> > >; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstBox::~ConstBox() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 109 | BOOST_CONCEPT_USAGE(ConstBox) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstBox > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstBox > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point >; Indexable = boost::geometry::model::box > >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int; node_pointer = boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstBox > > >]': D:/RCompile/CRANpkg/lib/4.6/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 > >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::box > >; Strategy = default_strategy]' 251 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::box > >]' 282 | return geometry::comparable_distance(geometry1, geometry2, default_strategy()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:141:45: required from 'static boost::geometry::index::detail::comparable_distance_call::result_type boost::geometry::index::detail::comparable_distance_call::apply(const G1&, const G2&, const boost::geometry::default_strategy&) [with G1 = boost::geometry::model::point >; G2 = boost::geometry::model::box > >; result_type = double]' 141 | return geometry::comparable_distance(g1, g2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point >; Indexable = boost::geometry::model::box > >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int; node_pointer = boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstBox::~ConstBox() [with Geometry = boost::geometry::model::box > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 109 | BOOST_CONCEPT_USAGE(ConstBox) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::geometry::model::point >, boost::geometry::model::point > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5: required from 'struct boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, boost::geometry::model::point >, boost::geometry::model::point > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, boost::geometry::model::point >, boost::geometry::model::point > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, boost::geometry::model::point >, boost::geometry::model::point > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point >; Indexable = boost::geometry::model::box > >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int; node_pointer = boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >]': D:/RCompile/CRANpkg/lib/4.6/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::return_type::type boost::geometry::strategy::distance::cross_track_point_box::apply(const Point&, const Box&) const [with Point = boost::geometry::model::point >; Box = boost::geometry::model::box > >; CalculationType = void; Strategy = boost::geometry::strategy::distance::comparable::haversine; typename return_type::type = double]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/distance/point_to_geometry.hpp:141:53: required from 'static auto boost::geometry::detail::distance::point_to_box::apply(const Point&, const Box&, const Strategies&) [with Point = boost::geometry::model::point >; Box = boost::geometry::model::box > >; Strategies = boost::geometry::strategies::distance::detail::comparable >; bool IsUmbrella = true]' 141 | return strategies.distance(point, box).apply(point, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:113:21: required from 'static auto boost::geometry::resolve_strategy::comparable_distance::apply(const Geometry1&, const Geometry2&, boost::geometry::default_strategy) [with Geometry1 = boost::geometry::model::point >; Geometry2 = boost::geometry::model::box > >]' 110 | return dispatch::distance | ~~~~~~~~~~~~~~~~~~ 111 | < | ~ 112 | Geometry1, Geometry2, comparable_strategy_type | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | >::apply(geometry1, geometry2, comparable_strategy_type()); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:140:21: required from 'static auto boost::geometry::resolve_dynamic::comparable_distance::apply(const Geometry1&, const Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::model::point >; Geometry2 = boost::geometry::model::box > >; Tag1 = boost::geometry::point_tag; Tag2 = boost::geometry::box_tag]' 137 | return resolve_strategy::comparable_distance | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 138 | < | ~ 139 | Strategy | ~~~~~~~~ 140 | >::apply(geometry1, geometry2, strategy); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Geometry2 = model::box > >; Strategy = default_strategy]' 253 | return resolve_dynamic::comparable_distance | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 254 | < | ~ 255 | Geometry1, | ~~~~~~~~~~ 256 | Geometry2 | ~~~~~~~~~ 257 | >::apply(geometry1, geometry2, strategy); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/comparable_distance/interface.hpp:282:41: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point >; Indexable = boost::geometry::model::box > >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int; node_pointer = boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::PointDistanceStrategy::~PointDistanceStrategy() [with Strategy = boost::geometry::strategy::distance::comparable::haversine; Point1 = boost::geometry::model::point >; Point2 = boost::geometry::model::point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 127 | BOOST_CONCEPT_USAGE(PointDistanceStrategy) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: required from 'class boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Ring::~Ring() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 48 | BOOST_CONCEPT_USAGE(Ring) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>&> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:499:55: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 499 | dispatch::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>&>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>&>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_iterator::type = std::vector >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_reference::type = boost::geometry::model::point&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:114:22: required from 'static void boost::geometry::detail::conversion::box_to_range::apply(const Box&, Range&) [with Box = boost::geometry::model::box >; Range = boost::geometry::model::ring, true, true, std::vector, std::allocator>; bool Close = true; bool Reverse = false]' 114 | range::at(range, 4) = range::at(range, 0); | ~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:499:55: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 499 | dispatch::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>&>::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, false, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: required from 'class boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, false, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, false, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:498:82: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 498 | concepts::check_concepts_and_equal_dimensions(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Ring::~Ring() [with Geometry = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 48 | BOOST_CONCEPT_USAGE(Ring) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, false, std::vector, std::allocator>&> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, false, std::vector, std::allocator>&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, false, std::vector, std::allocator>&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, false, std::vector, std::allocator>&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator>&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator>&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:499:55: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 499 | dispatch::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator>&>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator>&>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = boost::geometry::model::ring, true, false, std::vector, std::allocator>&; typename boost::range_iterator::type = std::vector >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = boost::geometry::model::ring, true, false, std::vector, std::allocator>&; typename boost::range_reference::type = boost::geometry::model::point&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:114:22: required from 'static void boost::geometry::detail::conversion::box_to_range::apply(const Box&, Range&) [with Box = boost::geometry::model::box >; Range = boost::geometry::model::ring, true, false, std::vector, std::allocator>; bool Close = false; bool Reverse = false]' 114 | range::at(range, 4) = range::at(range, 0); | ~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:499:55: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 499 | dispatch::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator>&>::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstBox > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstBox > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point; Indexable = boost::geometry::model::box >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator, unsigned int> > >; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest >; size_type = long long unsigned int; node_pointer = boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator, unsigned int> > >; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest >; OutIter = std::back_insert_iterator, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest >; OutIter = std::back_insert_iterator, unsigned int> > >; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstBox::~ConstBox() [with Geometry = boost::geometry::model::box >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 109 | BOOST_CONCEPT_USAGE(ConstBox) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstBox > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstBox > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstBox > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point >; Indexable = boost::geometry::model::box > >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int; node_pointer = boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstBox::~ConstBox() [with Geometry = boost::geometry::model::box > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/box_concept.hpp:109:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 109 | BOOST_CONCEPT_USAGE(ConstBox) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::geometry::model::point >, boost::geometry::model::point > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5: required from 'struct boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::PointDistanceStrategy, boost::geometry::model::point >, boost::geometry::model::point > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, boost::geometry::model::point >, boost::geometry::model::point > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, boost::geometry::model::point >, boost::geometry::model::point > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/distance_predicates.hpp:173:34: required from 'static bool boost::geometry::index::detail::calculate_distance, Indexable, Strategy, Tag>::apply(const boost::geometry::index::detail::predicates::nearest&, const Indexable&, const Strategy&, result_type&) [with PointRelation = boost::geometry::model::point >; Indexable = boost::geometry::model::box > >; 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); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:240:58: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(node_pointer, size_type, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int; node_pointer = boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/distance_query.hpp:213:21: required from 'boost::geometry::index::detail::rtree::visitors::distance_query::size_type boost::geometry::index::detail::rtree::visitors::distance_query::apply(const MembersHolder&, OutIter) [with OutIter = std::back_insert_iterator >, unsigned int> > >; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; Predicates = boost::geometry::index::detail::predicates::nearest > >; size_type = long long unsigned int]' 213 | return apply(members.root, members.leafs_level, out_it); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1891:32: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query_dispatch(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; typename std::enable_if<(boost::geometry::index::detail::predicates_count_distance::value > 0), int>::type = 0; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long long unsigned int]' 1891 | return distance_v.apply(m_members, out_it); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1088:30: required from 'boost::geometry::index::rtree::size_type boost::geometry::index::rtree::query(const Predicates&, OutIter) const [with Predicates = boost::geometry::index::detail::predicates::nearest > >; OutIter = std::back_insert_iterator >, unsigned int> > >; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; size_type = long 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)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::PointDistanceStrategy::~PointDistanceStrategy() [with Strategy = boost::geometry::strategy::distance::comparable::haversine; Point1 = boost::geometry::model::point >; Point2 = boost::geometry::model::point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/distance_concept.hpp:127:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 127 | BOOST_CONCEPT_USAGE(PointDistanceStrategy) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>&>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>&> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:499:55: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 499 | dispatch::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, true, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:268:59: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 268 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, true, std::vector, std::allocator>&]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, false, std::vector, std::allocator>&>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, false, std::vector, std::allocator>&> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, false, std::vector, std::allocator>&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, false, std::vector, std::allocator>&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, false, std::vector, std::allocator>&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, false, std::vector, std::allocator>&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:499:55: required from 'static void boost::geometry::resolve_variant::convert::apply(const Geometry1&, Geometry2&) [with Geometry1 = boost::geometry::model::box >; Geometry2 = boost::geometry::model::ring, true, false, std::vector, std::allocator>]' 499 | dispatch::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/convert.hpp:551:58: required from 'void boost::geometry::convert(const Geometry1&, Geometry2&) [with Geometry1 = model::box >; Geometry2 = model::ring, true, false, std::vector, std::allocator>]' 551 | resolve_variant::convert::apply(geometry1, geometry2); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:289:30: required from 'static void boost::geometry::detail::wkt::wkt_box::do_apply(std::basic_ostream&, const Box&) [with RingType = boost::geometry::model::ring, true, false, std::vector, std::allocator>; Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 289 | geometry::convert(box, ring); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:272:60: required from 'static void boost::geometry::detail::wkt::wkt_box::apply(std::basic_ostream&, const Box&, bool) [with Char = char; Traits = std::char_traits; Box = boost::geometry::model::box >]' 272 | do_apply >(os, box); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/wkt/write.hpp:541:39: required from 'std::basic_ostream& boost::geometry::operator<<(std::basic_ostream&, const wkt_manipulator&) [with Char = char; Traits = std::char_traits; Geometry = model::box >]' 541 | dispatch::wkt::apply(os, m.m_geometry, m.m_force_closure); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:71:36: required from here 71 | ss << bg::wkt(query_box) << std::endl; | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, false, std::vector, std::allocator>&]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, unsigned int>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = std::pair >, unsigned int>*; Value = std::pair >, unsigned int>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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 >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:29, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:20: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal >, unsigned int>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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 >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::insert >, unsigned int>, boost::geometry::index::rtree >, 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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:837:15: required from 'void boost::geometry::index::rtree::insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 837 | this->raw_insert(value); | ~~~~~~^~~~~~~~~~ libgeoda/SpatialIndAlgs.cpp:53:21: required from here 53 | rtree.insert(std::make_pair(b, i)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, unsigned int>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = std::pair, unsigned int>*; Value = std::pair, unsigned int>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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 >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal, unsigned int>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::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, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::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, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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 >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, unsigned int>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = std::pair >, unsigned int>*; Value = std::pair >, unsigned int>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal >, unsigned int>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::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 >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 > >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator >, unsigned int> >, boost::geometry::index::equal_to >, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair >, unsigned int>; MembersHolder = boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, unsigned int>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible, unsigned int>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = std::pair, unsigned int>*; Value = std::pair, unsigned int>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::apply(Node&, Node&, box_type&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::apply(nodes_container_type&, Node&, box_type&, const parameters_type&, const translator_type&, allocators_type&) [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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 >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_leaf, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:627:28: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal, unsigned int>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/varray.hpp:268:9: required from 'boost::geometry::index::detail::varray::varray(Iterator, Iterator) [with Iterator = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>; long long unsigned int Capacity = 17]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/quadratic/redistribute_elements.hpp:131:24: required from 'static void boost::geometry::index::detail::rtree::redistribute_elements::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, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; box_type = boost::geometry::model::box >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 131 | container_type elements_copy(elements1.begin(), elements1.end()); // MAY THROW, STRONG (alloc, copy) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:190:24: required from 'static void boost::geometry::index::detail::rtree::split::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, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder; nodes_container_type = boost::geometry::index::detail::varray >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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 >; parameters_type = boost::geometry::index::quadratic<16>; translator_type = boost::geometry::index::detail::translator, unsigned int> >, boost::geometry::index::equal_to, unsigned int> > >; allocators_type = boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>]' 189 | redistribute_elements | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 190 | ::apply(n, n2, n_box, box2, parameters, translator, allocators); // MAY THROW (V, E: alloc, copy, copy) | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:406:26: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::split(Node&) const [with Node = boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, 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) | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:375:18: required from 'void boost::geometry::index::detail::rtree::visitors::detail::insert::post_traverse(Node&) [with Node = boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>; Element = std::pair, unsigned int>; MembersHolder = boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder]' 375 | split(n); // MAY THROW (V, E: alloc, copy, N:alloc) | ~~~~~^~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/detail/rtree/visitors/insert.hpp:616:28: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:17: note: in a call to non-static member function 'boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>::~ForwardTraversal()' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/concept_def.hpp:29:12: note: in definition of macro 'BOOST_concept' 29 | struct name | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = std::pair >, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::rtree >, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert >, unsigned int>, boost::geometry::index::rtree >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; value_type = std::pair >, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair >, long long unsigned int>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair > >, boost::variant >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator, unsigned int>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible, unsigned int>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, unsigned int>*> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible, unsigned int>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal, unsigned int>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal, unsigned int>*>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, unsigned int>*> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = std::pair, unsigned int>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:108:3: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 108 | BOOST_concept(IncrementableIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: required from 'struct boost_concepts::IncrementableIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost_concepts::IncrementableIterator::~IncrementableIterator() [with Iterator = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:120:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 120 | BOOST_CONCEPT_USAGE(IncrementableIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:129:3: required from 'struct boost_concepts::SinglePassIterator >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 129 | BOOST_concept(SinglePassIterator,(Iterator)) | ^~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:141:3: required from 'struct boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*>' 141 | BOOST_concept(ForwardTraversal,(Iterator)) | ^~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost_concepts::ForwardTraversal >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, 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) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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, unsigned int>, geometry::index::rtree, unsigned int>, geometry::index::quadratic<16> >::members_holder, geometry::index::detail::rtree::insert_default_tag>; Visitable = variant, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16>, geometry::model::box >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::insert, unsigned int>, boost::geometry::index::rtree, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder, insert_default_tag>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box >; Allocators = allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1668:37: required from 'void boost::geometry::index::rtree::raw_insert(const value_type&) [with Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; value_type = std::pair, unsigned int>]' 1668 | detail::rtree::apply_visitor(insert_v, *m_members.root); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1799:15: required from 'void boost::geometry::index::rtree::insert_dispatch(const ValueConvertible&, std::true_type) [with ValueConvertible = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, unsigned int> >; std::true_type = std::true_type]' 1799 | this->raw_insert(val_conv); | ~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:893:30: required from 'void boost::geometry::index::rtree::insert(const ConvertibleOrRange&) [with ConvertibleOrRange = std::pair, long long unsigned int>; Value = std::pair, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable, unsigned int> >; EqualTo = boost::geometry::index::equal_to, unsigned int> >; Allocator = boost::container::new_allocator, 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)); | ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::geometry::index::detail::rtree::ptr_pair >, boost::variant, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::variant_internal_node, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::allocators, unsigned int> >, std::pair, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box >, boost::geometry::index::detail::rtree::node_variant_static_tag>, boost::geometry::index::detail::rtree::node_variant_static_tag> >*>*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, 0, 1, boost::geometry::point_tag> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, 0, 1, boost::geometry::point_tag> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, boost::geometry::point_tag>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate >, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag> >]' 342 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 357 | return apply( | ~~~~~^ 358 | geometry1, | ~~~~~~~~~~ 359 | geometry2, | ~~~~~~~~~~ 360 | typename detail::transform::select_strategy::type() | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:378:50: required from 'static bool boost::geometry::resolve_variant::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 378 | return resolve_strategy::transform::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 379 | geometry1, | ~~~~~~~~~~ 380 | geometry2, | ~~~~~~~~~~ 381 | strategy | ~~~~~~~~ 382 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view >, 0, 1, point_tag>; Strategy = default_strategy]' 444 | return resolve_variant::transform | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 445 | ::apply(geometry1, geometry2, strategy); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:463:31: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, 0, 1, boost::geometry::point_tag> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, 0, 1, boost::geometry::point_tag> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, boost::geometry::point_tag>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate >, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag> >]' 343 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 357 | return apply( | ~~~~~^ 358 | geometry1, | ~~~~~~~~~~ 359 | geometry2, | ~~~~~~~~~~ 360 | typename detail::transform::select_strategy::type() | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:378:50: required from 'static bool boost::geometry::resolve_variant::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 378 | return resolve_strategy::transform::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 379 | geometry1, | ~~~~~~~~~~ 380 | geometry2, | ~~~~~~~~~~ 381 | strategy | ~~~~~~~~ 382 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/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 >, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view >, 0, 1, point_tag>; Strategy = default_strategy]' 444 | return resolve_variant::transform | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 445 | ::apply(geometry1, geometry2, strategy); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:463:31: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 0>, 0, 1, boost::geometry::point_tag> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >, 0>, 0, 1, boost::geometry::point_tag> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, boost::geometry::point_tag>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate > >, 0>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag> >]' 342 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 357 | return apply( | ~~~~~^ 358 | geometry1, | ~~~~~~~~~~ 359 | geometry2, | ~~~~~~~~~~ 360 | typename detail::transform::select_strategy::type() | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:378:50: required from 'static bool boost::geometry::resolve_variant::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 378 | return resolve_strategy::transform::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 379 | geometry1, | ~~~~~~~~~~ 380 | geometry2, | ~~~~~~~~~~ 381 | strategy | ~~~~~~~~ 382 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view > >, 0>, 0, 1, point_tag>; Strategy = default_strategy]' 444 | return resolve_variant::transform | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 445 | ::apply(geometry1, geometry2, strategy); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:463:31: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 0>, 0, 1, boost::geometry::point_tag> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >, 0>, 0, 1, boost::geometry::point_tag> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, boost::geometry::point_tag>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate > >, 0>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag> >]' 343 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 357 | return apply( | ~~~~~^ 358 | geometry1, | ~~~~~~~~~~ 359 | geometry2, | ~~~~~~~~~~ 360 | typename detail::transform::select_strategy::type() | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:378:50: required from 'static bool boost::geometry::resolve_variant::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 378 | return resolve_strategy::transform::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 379 | geometry1, | ~~~~~~~~~~ 380 | geometry2, | ~~~~~~~~~~ 381 | strategy | ~~~~~~~~ 382 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 0>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view > >, 0>, 0, 1, point_tag>; Strategy = default_strategy]' 444 | return resolve_variant::transform | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 445 | ::apply(geometry1, geometry2, strategy); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:463:31: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 1>, 0, 1, boost::geometry::point_tag> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >, 1>, 0, 1, boost::geometry::point_tag> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, boost::geometry::point_tag>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate > >, 1>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag> >]' 342 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 357 | return apply( | ~~~~~^ 358 | geometry1, | ~~~~~~~~~~ 359 | geometry2, | ~~~~~~~~~~ 360 | typename detail::transform::select_strategy::type() | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:378:50: required from 'static bool boost::geometry::resolve_variant::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 378 | return resolve_strategy::transform::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 379 | geometry1, | ~~~~~~~~~~ 380 | geometry2, | ~~~~~~~~~~ 381 | strategy | ~~~~~~~~ 382 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view > >, 1>, 0, 1, point_tag>; Strategy = default_strategy]' 444 | return resolve_variant::transform | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 445 | ::apply(geometry1, geometry2, strategy); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:463:31: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 1>, 0, 1, boost::geometry::point_tag> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >, 1>, 0, 1, boost::geometry::point_tag> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: [ skipping 24 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, boost::geometry::point_tag>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>; Strategy = boost::geometry::strategy::transform::copy_per_coordinate > >, 1>, 0, 1, boost::geometry::point_tag>, boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag> >]' 343 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 357 | return apply( | ~~~~~^ 358 | geometry1, | ~~~~~~~~~~ 359 | geometry2, | ~~~~~~~~~~ 360 | typename detail::transform::select_strategy::type() | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 361 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:378:50: required from 'static bool boost::geometry::resolve_variant::transform::apply(const Geometry1&, Geometry2&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry1 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>; Geometry2 = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 378 | return resolve_strategy::transform::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 379 | geometry1, | ~~~~~~~~~~ 380 | geometry2, | ~~~~~~~~~~ 381 | strategy | ~~~~~~~~ 382 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/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 > >, 1>, 0, 1, point_tag>; Geometry2 = detail::two_dimensional_view > >, 1>, 0, 1, point_tag>; Strategy = default_strategy]' 444 | return resolve_variant::transform | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 445 | ::apply(geometry1, geometry2, strategy); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/transform.hpp:463:31: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, 0, 1, boost::geometry::point_tag> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, 0, 1, boost::geometry::point_tag> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view >, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 0>, 0, 1, boost::geometry::point_tag> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint > >, 0>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 0>, 0, 1, boost::geometry::point_tag> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point > >, 0>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 0>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 0>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 1>, 0, 1, boost::geometry::point_tag> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint > >, 1>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, 1>, 0, 1, boost::geometry::point_tag> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point > >, 1>, 0, 1, boost::geometry::point_tag> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, 1>, 0, 1, boost::geometry::point_tag> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 25 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2214:43: required from 'typename Visitor::result_type boost::variant::internal_apply_visitor(Visitor&) [with Visitor = boost::detail::variant::invoke_visitor >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>, false>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant.hpp:2251:44: required from 'typename Visitor::result_type boost::variant::apply_visitor(Visitor&) & [with Visitor = boost::geometry::index::detail::rtree::visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; T0_ = boost::geometry::index::detail::rtree::variant_leaf >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, 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 >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, boost::geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16, 4>, boost::geometry::model::box > >, 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >, unsigned int>, geometry::index::quadratic<16> >::members_holder>; Visitable = variant >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16>, geometry::model::box > >, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::node_variant_static_tag>, geometry::index::detail::rtree::variant_internal_node >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, geometry::index::detail::rtree::allocators >, unsigned int> >, std::pair >, unsigned int>, geometry::index::quadratic<16, 4>, geometry::model::box > >, 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).apply_visitor(visitor); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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_internal_node >&) [with Visitor = visitors::children_box >, unsigned int>, boost::geometry::index::quadratic<16> >::members_holder>; Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; Box = boost::geometry::model::box > >; Allocators = allocators >, unsigned int> >, std::pair >, unsigned int>, boost::geometry::index::quadratic<16>, boost::geometry::model::box > >, node_variant_static_tag>; Tag = node_variant_static_tag]' 51 | boost::apply_visitor(v, n); | ~~~~~~~~~~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/index/rtree.hpp:1503:41: required from 'boost::geometry::index::rtree::bounds_type boost::geometry::index::rtree::bounds() const [with Value = std::pair >, unsigned int>; Parameters = boost::geometry::index::quadratic<16>; IndexableGetter = boost::geometry::index::indexable >, unsigned int> >; EqualTo = boost::geometry::index::equal_to >, unsigned int> >; Allocator = boost::container::new_allocator >, unsigned int> >; bounds_type = boost::geometry::model::box > >]' 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())); | ~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::detail::two_dimensional_view > >, 1>, 0, 1, boost::geometry::point_tag>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/pg/geoms.cpp -o libgeoda/pg/geoms.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/pg/utils.cpp -o libgeoda/pg/utils.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/shapelib/dbfopen.cpp -o libgeoda/shapelib/dbfopen.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/shapelib/safileio.cpp -o libgeoda/shapelib/safileio.o libgeoda/shapelib/safileio.cpp:82:16: warning: "NOMINMAX" redefined 82 | # define NOMINMAX | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/x86_64-w64-mingw32.static.posix/bits/c++config.h:680, from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/requires_hosted.h:31, from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/cmath:41, from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/math.h:36, from libgeoda/shapelib/safileio.cpp:70: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/x86_64-w64-mingw32.static.posix/bits/os_defines.h:45:9: note: this is the location of the previous definition 45 | #define NOMINMAX 1 | ^~~~~~~~ libgeoda/shapelib/safileio.cpp:84: warning: ignoring '#pragma comment ' [-Wunknown-pragmas] 84 | # pragma comment(lib, "kernel32.lib") g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/shapelib/shpopen.cpp -o libgeoda/shapelib/shpopen.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/weights/PointsToContigWeights.cpp -o libgeoda/weights/PointsToContigWeights.o libgeoda/weights/PointsToContigWeights.cpp: In function 'bool gda::PointsToContiguity(const std::vector&, const std::vector&, bool, std::vector >&)': libgeoda/weights/PointsToContigWeights.cpp:99:23: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long long unsigned int'} and 'int' [-Wsign-compare] 99 | for (size_t i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 81 | for (int i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 92 | for (int i=0; i::size_type' {aka 'long 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::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 107 | for (int j=0; j::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/svg/svg_mapper.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometry.hpp:129: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/cstdfloat.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/detail/float128_functions.hpp:15, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/detail/fpclassify.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/detail/default_ops.hpp:15, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/number.hpp:12, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/cpp_int.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/multiprecision/cpp_bin_float.hpp:15, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/core/coordinate_promotion.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/core/radian_access.hpp:28, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometry.hpp:50: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/multi/geometries/multi_point.hpp:17, from libgeoda/weights/VoronoiUtils.cpp:30: D:/RCompile/CRANpkg/lib/4.6/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))) | ^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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") | ^~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/BatchLISA.cpp -o libgeoda/sa/BatchLISA.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/BatchLocalMoran.cpp -o libgeoda/sa/BatchLocalMoran.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/LISA.cpp -o libgeoda/sa/LISA.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/sa/LISA.cpp:8: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template 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 long unsigned int'} and 'int' [-Wsign-compare] 477 | for (size_t perm = 0; perm < permutations; perm++) { | ~~~~~^~~~~~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/MultiGeary.cpp -o libgeoda/sa/MultiGeary.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/MultiJoinCount.cpp -o libgeoda/sa/MultiJoinCount.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 long unsigned int'} and 'int' [-Wsign-compare] 217 | for (size_t perm = 0; perm < permutations; perm++) { | ~~~~~^~~~~~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/UniG.cpp -o libgeoda/sa/UniG.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/UniGeary.cpp -o libgeoda/sa/UniGeary.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/UniGstar.cpp -o libgeoda/sa/UniGstar.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/UniJoinCount.cpp -o libgeoda/sa/UniJoinCount.o 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 long unsigned int'} and 'int' [-Wsign-compare] 218 | for (size_t perm = 0; perm < permutations; perm++) { | ~~~~~^~~~~~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/UniLocalMoran.cpp -o libgeoda/sa/UniLocalMoran.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/sa/BiLocalMoran.cpp -o libgeoda/sa/BiLocalMoran.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/redcap.cpp -o libgeoda/clustering/redcap.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_traits.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:14, from libgeoda/clustering/redcap.cpp:31: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/vector_property_map.hpp:14, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:598, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/properties.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/named_function_params.hpp:26, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/opt_storage.hpp:11, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/allocator_constructed.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/implementation.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/map.hpp:8, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/unordered_map.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered_map.hpp:17, from libgeoda/clustering/redcap.cpp:30: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/scoped_ptr.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr.hpp:17, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:26: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ 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::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 596 | for (int j=0; j::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 702 | for (int j=0; j::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:31, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:20: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/int.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/lambda_fwd.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_spec.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/if.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_traits.hpp:17: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:603:11: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:603:11: required from 'boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:514:9: required from 'boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:109:22: note: in a call to non-static member function 'boost::SignedInteger::~SignedInteger()' 109 | template <> struct SignedInteger< ::boost::long_long_type> {}; | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:545:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:545:11: required from 'boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:573:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:573:11: required from 'boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = vec_adj_list_vertex_id_map]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 556 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 557 | distance_map.begin(), index_map, distance_map[0])), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:87:5: required from 'struct boost::concepts::IncidenceGraph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]': D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >, boost::adjacency_list > >]': D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function 'void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >; Graph = boost::adjacency_list >]' 37 | void constraints() | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]': D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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&, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 205 | void constraints() { | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:87:5: required from 'struct boost::concepts::IncidenceGraph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >' 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from 'void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >; Graph = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >, boost::adjacency_list > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >, boost::adjacency_list > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >, boost::adjacency_list > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >, boost::adjacency_list > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >::~CopyConstructibleConcept()' 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept' 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long long unsigned int>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:206:7: required from 'void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, long long unsigned int> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 147 | void constraints() { | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long long unsigned int>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:207:7: required from 'void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, long long unsigned int> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 179 | void constraints() { | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:208:7: required from 'void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, long long unsigned int> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept::~ConvertibleConcept()' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long long unsigned int*; ID = vec_adj_list_vertex_id_map; typename std::iterator_traits< >::value_type = long long unsigned int; typename std::iterator_traits< >::reference = long long unsigned int&]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from 'static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Value = long long unsigned int; type = boost::iterator_property_map, long long unsigned int, long long unsigned int&>]' 245 | return make_iterator_property_map(array_holder.get(), index); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from 'static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Value = long long unsigned int; type = boost::iterator_property_map, long long unsigned int, long long unsigned int&>]' 273 | return helper::build(g, index, array_holder); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 377 | = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:52:50: required from 'struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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( | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:90:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:91:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:92:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:93:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistZero = double; ColorMap = two_bit_color_map >]' 387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; SourceInputIter = long long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>; WeightMap = adj_list_edge_property_map, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map; Compare = std::less; Combine = detail::_project2nd; DistInf = double; DistZero = double; ColorMap = two_bit_color_map >]' 464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 465 | weight, index_map, compare, combine, zero, vis, color); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >' 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map, boost::edge_weight_t>, int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>, boost::detail::_project2nd, std::less >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:148:7: required from 'void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, long long unsigned int> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept::~ConvertibleConcept()' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:180:7: required from 'void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >; Key = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long long unsigned int>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >, long long unsigned int> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >, long long unsigned int> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >, long long unsigned int>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept::~ConvertibleConcept()' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 | ^ D:/RCompile/CRANpkg/lib/4.6/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) \ | ^~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator' 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator::~InputIterator() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator' 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator::~ForwardIterator() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable::~Comparable() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long long unsigned int*]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:68:9: required from 'boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = long long unsigned int]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:69:9: required from 'boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = long long unsigned int]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Assignable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:70:9: required from 'boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph > >' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = long long unsigned int]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:52:50: required from 'struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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( | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = long long unsigned int]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = long long unsigned int]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = long long unsigned int]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35: required from 'boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Buffer = d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >; BFSVisitor = detail::dijkstra_bfs_visitor, d_ary_heap_indirect, long long unsigned int, long long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, std::less, std::vector > >, adj_list_edge_property_map, edge_weight_t>, int*, iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, double, double&>, detail::_project2nd, std::less >; ColorMap = two_bit_color_map >; SourceIterator = long long unsigned int*]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible, std::input_iterator_tag>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, std::input_iterator_tag> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, std::input_iterator_tag>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:53:35: required from 'boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int>]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long long unsigned int, boost::detail::edge_desc_impl, long long int> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible, std::input_iterator_tag>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, std::input_iterator_tag> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map; Params = boost::bgl_named_params<_project2nd, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long 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); | ~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits::vertex_descriptor, const bgl_named_params&) [with VertexListGraph = adjacency_list >; Param = detail::_project2nd; Tag = distance_combine_t; Rest = bgl_named_params, distance_compare_t, bgl_named_params, edge_weight_t>, edge_weight_t, bgl_named_params > >; typename graph_traits::vertex_descriptor = long 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); | ~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = boost::adjacency_list >; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long long unsigned int]' 43 | dijkstra_shortest_paths( | ~~~~~~~~~~~~~~~~~~~~~~~^ 44 | G, s, params.distance_compare(compare).distance_combine(combine)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; 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()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/redcap_wrapper.cpp -o libgeoda/clustering/redcap_wrapper.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/clustering/redcap_wrapper.cpp:5: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/scoped_ptr.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/adjacency_list.hpp:22, from libgeoda/clustering/redcap.h:31, from libgeoda/clustering/redcap_wrapper.cpp:9: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/vector_property_map.hpp:14, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:598, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/adjacency_list.hpp:27: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ 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, from libgeoda/clustering/redcap_wrapper.cpp:7: 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/azp.cpp -o libgeoda/clustering/azp.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_adaptor.hpp:14, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/heap/detail/stable_heap.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/heap/priority_queue.hpp:19, from libgeoda/clustering/azp.h:30, from libgeoda/clustering/azp.cpp:8: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from libgeoda/clustering/../DataUtils.h:19, from libgeoda/clustering/azp.cpp:7: 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/maxp_wrapper.cpp -o libgeoda/clustering/maxp_wrapper.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/clustering/maxp_wrapper.cpp:5: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/azp_wrapper.cpp -o libgeoda/clustering/azp_wrapper.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/clustering/azp_wrapper.cpp:5: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/schc_wrapper.cpp -o libgeoda/clustering/schc_wrapper.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/placeholders.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_categories.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_facade.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range_core.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/iterator_range.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/as_literal.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/trim.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:19, from libgeoda/clustering/schc_wrapper.cpp:5: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string.hpp:23: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_base.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:14: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/scoped_ptr.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/adjacency_list.hpp:22, from libgeoda/clustering/redcap.h:31, from libgeoda/clustering/schc_wrapper.cpp:9: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/vector_property_map.hpp:14, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/property_map/property_map.hpp:598, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/graph/adjacency_list.hpp:27: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template 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 >&, unsigned int, const std::string&, const std::vector&, double, double**)': libgeoda/clustering/schc_wrapper.cpp:98:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 98 | for (int i=0; iordered_edges.size(); ++i) { | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/schc_wrapper.cpp:134:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector::size_type' {aka 'long 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, from libgeoda/clustering/schc_wrapper.cpp:7: 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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/cluster.cpp -o libgeoda/clustering/cluster.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/joincount_ratio.cpp -o libgeoda/clustering/joincount_ratio.o libgeoda/clustering/joincount_ratio.cpp: In function 'std::vector joincount_ratio(const std::vector&, GeoDaWeight*)': libgeoda/clustering/joincount_ratio.cpp:48:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 48 | if (num_obs != clusters.size()) return result; | ~~~~~~~~^~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -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 >&, GeoDaWeight*)': libgeoda/clustering/make_spatial.cpp:259:29: warning: comparison of integer expressions of different signedness: 'std::map::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare] 259 | if (cluster_dict.size() != num_obs) { | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/clustering/spatial_validation.cpp -o libgeoda/clustering/spatial_validation.o In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/aux_/na_assert.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/arg.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/variant/variant_fwd.hpp:19, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/policies/relate/intersection_points.hpp:21, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/policies/relate/intersection_policy.hpp:21, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/intersection_strategies.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/strategies.hpp:37, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometry.hpp:57, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry.hpp:17, from libgeoda/clustering/spatial_validation.cpp:9: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of 'assert_arg' [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of 'assert_not_arg' [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/bind/mem_fn.hpp:23, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/mem_fn.hpp:22, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function/function_template.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/function.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/detail/find_iterator.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/find_iterator.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/iter_find.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/algorithm/string/split.hpp:16, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/io/svg/svg_mapper.hpp:27, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometry.hpp:129: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/get_pointer.hpp:48:40: warning: 'template class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/memory:78, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/opt_storage.hpp:11, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/allocator_constructed.hpp:13, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/implementation.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/detail/map.hpp:8, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered/unordered_map.hpp:18, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/unordered_map.hpp:17, from libgeoda/clustering/spatial_validation.cpp:8: D:/rtools45/x86_64-w64-mingw32.static.posix/lib/gcc/x86_64-w64-mingw32.static.posix/14.2.0/include/c++/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ libgeoda/clustering/spatial_validation.cpp: In constructor 'SpatialValidation::SpatialValidation(int, const std::vector >&, GeoDaWeight*, std::vector&, gda::ShapeType)': libgeoda/clustering/spatial_validation.cpp:492:29: warning: comparison of integer expressions of different signedness: 'std::map::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare] 492 | if (cluster_dict.size() != num_obs) { | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ In file included from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/assert.hpp:35, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/requires.hpp:8, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometry.hpp:54: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::polygon >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:415:70: required from here 415 | bg::model::polygon > poly; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:31, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:25, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:27: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Point >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::polygon >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:415:70: required from here 415 | bg::model::polygon > poly; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::d2::point_xy]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Point >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: required from 'class boost::geometry::concepts::Point >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Point >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/arithmetic/arithmetic.hpp:46:5: required from 'class boost::geometry::model::polygon >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:415:70: required from here 415 | bg::model::polygon > poly; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Point::~Point() [with Geometry = boost::geometry::model::d2::point_xy]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:74:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 74 | BOOST_CONCEPT_USAGE(Point) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:108:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPoint >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:108:5: required from 'class boost::geometry::concepts::ConstPolygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPolygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::d2::point_xy]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:152:13: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:152:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:281:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:281:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:191:13: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:191:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:322:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:322:9: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:218:14: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:218:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:356:9: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:356:9: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:239:14: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:239:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:374:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:374:9: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'class boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:109:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size_type.hpp:20, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:21, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:24, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/append.hpp:29, from D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/assign.hpp:27: D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5: required from 'class boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:109:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:109:5: required from 'class boost::geometry::concepts::ConstPolygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPolygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstRing::~ConstRing() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 78 | BOOST_CONCEPT_USAGE(ConstRing) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPolygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPolygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPolygon > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstPolygon > >]': D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPolygon::~ConstPolygon() [with PolygonType = boost::geometry::model::polygon >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPolygon) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: required from 'class boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator> >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:60:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:421:31: required from here 421 | bg::append(poly, bg::model::d2::point_xy(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:60:5: required from 'class boost::geometry::concepts::Polygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Polygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:421:31: required from here 421 | bg::append(poly, bg::model::d2::point_xy(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Ring::~Ring() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 48 | BOOST_CONCEPT_USAGE(Ring) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5: required from 'class boost::geometry::concepts::Polygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Polygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:421:31: required from here 421 | bg::append(poly, bg::model::d2::point_xy(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Polygon > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::Polygon > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:421:31: required from here 421 | bg::append(poly, bg::model::d2::point_xy(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Polygon::~Polygon() [with PolygonType = boost::geometry::model::polygon >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 83 | BOOST_CONCEPT_USAGE(Polygon) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPoint >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPoint >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPoint >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPoint::~ConstPoint() [with Geometry = boost::geometry::model::d2::point_xy]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/point_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPoint) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator> >' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator> >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator> >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5: required from 'class boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstRing, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstRing::~ConstRing() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:78:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 78 | BOOST_CONCEPT_USAGE(ConstRing) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstPolygon > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5: required from 'class boost::geometry::concepts::ConstPolygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstPolygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:315:36: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 315 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstPolygon::~ConstPolygon() [with PolygonType = boost::geometry::model::polygon >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:128:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 128 | BOOST_CONCEPT_USAGE(ConstPolygon) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5: required from 'class boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >; Strategy = boost::geometry::strategies::area::cartesian<>]' 51 | return Policy::apply(exterior_ring(poly), strategy) | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:170:14: required from 'static auto boost::geometry::dispatch::area::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon >]' 166 | return calculate_polygon_sum::apply | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 167 | < | ~ 168 | typename area_result::type, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 169 | detail::area::ring_area | ~~~~~~~~~~~~~~~~~~~~~~~ 170 | >(polygon, strategy); | ~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:236:47: required from 'static auto boost::geometry::resolve_strategy::area::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon >]' 236 | return dispatch::area::apply(geometry, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:253:55: required from 'static auto boost::geometry::resolve_dynamic::area::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon >; Tag = boost::geometry::polygon_tag]' 253 | return resolve_strategy::area::apply(geometry, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:319:50: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 319 | return resolve_dynamic::area::apply(geometry, default_strategy()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:90:9: required from 'static typename boost::geometry::detail::area::area_result::type boost::geometry::detail::area::ring_area::apply(const Ring&, const Strategies&) [with Ring = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Strategies = boost::geometry::strategies::area::cartesian<>; typename boost::geometry::detail::area::area_result::type = double]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Strategy = boost::geometry::strategies::area::cartesian<>]' 51 | return Policy::apply(exterior_ring(poly), strategy) | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:170:14: required from 'static auto boost::geometry::dispatch::area::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon >]' 166 | return calculate_polygon_sum::apply | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 167 | < | ~ 168 | typename area_result::type, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 169 | detail::area::ring_area | ~~~~~~~~~~~~~~~~~~~~~~~ 170 | >(polygon, strategy); | ~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:236:47: required from 'static auto boost::geometry::resolve_strategy::area::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon >]' 236 | return dispatch::area::apply(geometry, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:253:55: required from 'static auto boost::geometry::resolve_dynamic::area::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon >; Tag = boost::geometry::polygon_tag]' 253 | return resolve_strategy::area::apply(geometry, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:319:50: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 319 | return resolve_dynamic::area::apply(geometry, default_strategy()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::AreaStrategy::~AreaStrategy() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Strategy = boost::geometry::strategy::area::cartesian<>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 67 | BOOST_CONCEPT_USAGE(AreaStrategy) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept > >' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept > >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept > >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:439:23: required from here 439 | bg::append(bg_points, bg::model::d2::point_xy(p->x, p->y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'class boost::geometry::concepts::MultiPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::MultiPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:439:23: required from here 439 | bg::append(bg_points, bg::model::d2::point_xy(p->x, p->y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept > >::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:48:5: required from 'class boost::geometry::concepts::MultiPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::MultiPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:439:23: required from here 439 | bg::append(bg_points, bg::model::d2::point_xy(p->x, p->y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::MultiPoint > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::MultiPoint > >]': D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:439:23: required from here 439 | bg::append(bg_points, bg::model::d2::point_xy(p->x, p->y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::MultiPoint::~MultiPoint() [with Geometry = boost::geometry::model::multi_point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: required from 'class boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Ring, true, true, std::vector, std::allocator> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:421:31: required from here 421 | bg::append(poly, bg::model::d2::point_xy(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Ring::~Ring() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/ring_concept.hpp:48:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 48 | BOOST_CONCEPT_USAGE(Ring) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::Polygon > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5: required from 'class boost::geometry::concepts::Polygon > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::Polygon > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/check.hpp:55:5: required from 'constexpr void boost::geometry::concepts::check() [with Geometry = boost::geometry::model::polygon >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:421:31: required from here 421 | bg::append(poly, bg::model::d2::point_xy(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::Polygon::~Polygon() [with PolygonType = boost::geometry::model::polygon >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/polygon_concept.hpp:83:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 83 | BOOST_CONCEPT_USAGE(Polygon) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5: required from 'class boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::AreaStrategy, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, boost::geometry::strategy::area::cartesian<> > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >; Strategy = boost::geometry::strategies::area::cartesian<>]' 51 | return Policy::apply(exterior_ring(poly), strategy) | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:170:14: required from 'static auto boost::geometry::dispatch::area::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon >]' 166 | return calculate_polygon_sum::apply | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 167 | < | ~ 168 | typename area_result::type, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 169 | detail::area::ring_area | ~~~~~~~~~~~~~~~~~~~~~~~ 170 | >(polygon, strategy); | ~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:236:47: required from 'static auto boost::geometry::resolve_strategy::area::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon >]' 236 | return dispatch::area::apply(geometry, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:253:55: required from 'static auto boost::geometry::resolve_dynamic::area::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon >; Tag = boost::geometry::polygon_tag]' 253 | return resolve_strategy::area::apply(geometry, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:319:50: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 319 | return resolve_dynamic::area::apply(geometry, default_strategy()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::AreaStrategy::~AreaStrategy() [with Geometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Strategy = boost::geometry::strategy::area::cartesian<>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/strategies/concepts/area_concept.hpp:67:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 67 | BOOST_CONCEPT_USAGE(AreaStrategy) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = geometry::model::ring, true, true, std::vector, std::allocator>; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:99:24: required from 'static typename boost::geometry::detail::area::area_result::type boost::geometry::detail::area::ring_area::apply(const Ring&, const Strategies&) [with Ring = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Strategies = boost::geometry::strategies::area::cartesian<>; typename boost::geometry::detail::area::area_result::type = double]' 99 | if (boost::size(ring) < detail::minimum_ring_size::value) | ~~~~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Strategy = boost::geometry::strategies::area::cartesian<>]' 51 | return Policy::apply(exterior_ring(poly), strategy) | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:170:14: required from 'static auto boost::geometry::dispatch::area::apply(const Polygon&, const Strategy&) [with Strategy = boost::geometry::strategies::area::cartesian<>; Polygon = boost::geometry::model::polygon >]' 166 | return calculate_polygon_sum::apply | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 167 | < | ~ 168 | typename area_result::type, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 169 | detail::area::ring_area | ~~~~~~~~~~~~~~~~~~~~~~~ 170 | >(polygon, strategy); | ~^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:236:47: required from 'static auto boost::geometry::resolve_strategy::area::apply(const Geometry&, boost::geometry::default_strategy) [with Geometry = boost::geometry::model::polygon >]' 236 | return dispatch::area::apply(geometry, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:253:55: required from 'static auto boost::geometry::resolve_dynamic::area::apply(const Geometry&, const Strategy&) [with Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::polygon >; Tag = boost::geometry::polygon_tag]' 253 | return resolve_strategy::area::apply(geometry, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/area.hpp:319:50: required from 'auto boost::geometry::area(const Geometry&) [with Geometry = model::polygon >]' 319 | return resolve_dynamic::area::apply(geometry, default_strategy()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ libgeoda/clustering/spatial_validation.cpp:423:47: required from here 423 | double element_area = bg::area(poly); | ~~~~~~~~^~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::ring, true, true, std::vector, std::allocator>]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept > >' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept > >' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept > >' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:439:23: required from here 439 | bg::append(bg_points, bg::model::d2::point_xy(p->x, p->y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = boost::geometry::model::multi_point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::MultiPoint > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:48:5: required from 'class boost::geometry::concepts::MultiPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::MultiPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long long int]' 272 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~ libgeoda/clustering/spatial_validation.cpp:439:23: required from here 439 | bg::append(bg_points, bg::model::d2::point_xy(p->x, p->y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::MultiPoint::~MultiPoint() [with Geometry = boost::geometry::model::multi_point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:278:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:281:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:281:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:321:9: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:322:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:322:9: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:355:9: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:356:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:356:9: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:373:9: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:374:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:374:9: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function 'boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>::~RandomAccessRangeConcept()' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 125 | struct IncrementableIteratorConcept : CopyConstructible | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 147 | struct SinglePassIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&> >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 318 | struct ForwardRangeConcept : SinglePassRangeConcept | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 352 | struct BidirectionalRangeConcept : ForwardRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:370:12: required from 'struct boost::RandomAccessRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>' 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 181 | struct ForwardIteratorConcept | ^~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: required from 'struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&>)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:95:5: required from 'typename boost::range_iterator::type boost::geometry::range::pos(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_iterator::type = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >::iterator; typename boost::range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/util/range.hpp:110:16: required from 'typename boost::range_reference::type boost::geometry::range::at(RandomAccessRange&&, typename boost::range_size::type) [with RandomAccessRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >&; typename boost::range_reference::type = boost::geometry::model::ring, true, true, std::vector, std::allocator>&; typename boost::range_size::type = long long unsigned int]' 110 | return *pos(rng, i); | ~~~^~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 104 | to_range_point::apply(range::at(int_rings, ring_index), point); | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator, true, true, std::vector, std::allocator>*, std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:76:5: required from 'class boost::geometry::concepts::ConstMultiPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstMultiPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_ > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/is_empty.hpp:158:40: required from 'static bool boost::geometry::resolve_dynamic::is_empty::apply(const Geometry&) [with Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 158 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/is_empty.hpp:208:54: required from 'bool boost::geometry::is_empty(const Geometry&) [with Geometry = model::multi_point >]' 208 | return resolve_dynamic::is_empty::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >; Strategy = default_strategy]' 588 | if (geometry::is_empty(geometry)) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >]' 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); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstMultiPoint > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::geometry::concepts::ConstMultiPoint > >]': D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/is_empty.hpp:158:40: required from 'static bool boost::geometry::resolve_dynamic::is_empty::apply(const Geometry&) [with Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 158 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/is_empty.hpp:208:54: required from 'bool boost::geometry::is_empty(const Geometry&) [with Geometry = model::multi_point >]' 208 | return resolve_dynamic::is_empty::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >; Strategy = default_strategy]' 588 | if (geometry::is_empty(geometry)) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >]' 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); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstMultiPoint::~ConstMultiPoint() [with Geometry = boost::geometry::model::multi_point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:61:27: required from 'static std::size_t boost::geometry::dispatch::num_interior_rings::apply(const Polygon&) [with Polygon = boost::geometry::model::polygon >; std::size_t = long long unsigned int]' 61 | return boost::size(geometry::interior_rings(polygon)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:93:61: required from 'static std::size_t boost::geometry::resolve_variant::num_interior_rings::apply(const Geometry&) [with Geometry = boost::geometry::model::polygon >; std::size_t = long long unsigned int]' 93 | return dispatch::num_interior_rings::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; std::size_t = long long unsigned int]' 135 | return resolve_variant::num_interior_rings::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 101 | else if (ring_index < signed_size_type(num_interior_rings(polygon))) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:61:27: required from 'static std::size_t boost::geometry::dispatch::num_interior_rings::apply(const Polygon&) [with Polygon = boost::geometry::model::polygon >; std::size_t = long long unsigned int]' 61 | return boost::size(geometry::interior_rings(polygon)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:93:61: required from 'static std::size_t boost::geometry::resolve_variant::num_interior_rings::apply(const Geometry&) [with Geometry = boost::geometry::model::polygon >; std::size_t = long long unsigned int]' 93 | return dispatch::num_interior_rings::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; std::size_t = long long unsigned int]' 135 | return resolve_variant::num_interior_rings::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 101 | else if (ring_index < signed_size_type(num_interior_rings(polygon))) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::geometry::concepts::ConstMultiPoint > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/geometries/concepts/multi_point_concept.hpp:76:5: required from 'class boost::geometry::concepts::ConstMultiPoint > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::geometry::concepts::ConstMultiPoint > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/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 >]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/is_empty.hpp:158:40: required from 'static bool boost::geometry::resolve_dynamic::is_empty::apply(const Geometry&) [with Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 158 | concepts::check(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/is_empty.hpp:208:54: required from 'bool boost::geometry::is_empty(const Geometry&) [with Geometry = model::multi_point >]' 208 | return resolve_dynamic::is_empty::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >; Strategy = default_strategy]' 588 | if (geometry::is_empty(geometry)) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >]' 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); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::geometry::concepts::ConstMultiPoint::~ConstMultiPoint() [with Geometry = boost::geometry::model::multi_point >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:61:27: required from 'static std::size_t boost::geometry::dispatch::num_interior_rings::apply(const Polygon&) [with Polygon = boost::geometry::model::polygon >; std::size_t = long long unsigned int]' 61 | return boost::size(geometry::interior_rings(polygon)); | ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/num_interior_rings.hpp:93:61: required from 'static std::size_t boost::geometry::resolve_variant::num_interior_rings::apply(const Geometry&) [with Geometry = boost::geometry::model::polygon >; std::size_t = long long unsigned int]' 93 | return dispatch::num_interior_rings::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; std::size_t = long long unsigned int]' 135 | return resolve_variant::num_interior_rings::apply(geometry); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; Point = boost::geometry::model::d2::point_xy; boost::geometry::signed_size_type = long long int]' 101 | else if (ring_index < signed_size_type(num_interior_rings(polygon))) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; RangeOrPoint = model::d2::point_xy; signed_size_type = long 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(x, y)); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, true, true, std::vector, std::allocator>, std::allocator, true, true, std::vector, std::allocator> > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, std::allocator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, std::allocator > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, std::allocator > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, std::allocator > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_, std::allocator > > >)>' 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:334:47: required from 'static void boost::geometry::dispatch::convex_hull_out::apply(const Geometry&, OutputGeometry&, const Strategies&) [with Geometry = boost::geometry::model::multi_point >; Strategies = boost::geometry::strategies::convex_hull::cartesian<>; OutputGeometry = boost::geometry::model::polygon >]' 334 | dispatch::convex_hull::apply(geometry, ring, strategies); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:524:57: required from 'static void boost::geometry::resolve_strategy::convex_hull::apply(const Geometry&, OutputGeometry&, const boost::geometry::default_strategy&) [with Geometry = boost::geometry::model::multi_point >; OutputGeometry = boost::geometry::model::polygon >]' 524 | dispatch::convex_hull_out::apply(geometry, out, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:547:55: required from 'static void boost::geometry::resolve_dynamic::convex_hull::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::polygon >; Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 547 | resolve_strategy::convex_hull::apply(geometry, out, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >; Strategy = default_strategy]' 594 | resolve_dynamic::convex_hull::apply(geometry, out, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >]' 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); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/size.hpp:62:9: required from 'typename boost::range_size::type boost::size(const SinglePassRange&) [with SinglePassRange = std::vector, std::allocator > >; typename range_size::type = long long unsigned int]' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/graham_andrew.hpp:294:44: required from 'static void boost::geometry::detail::convex_hull::graham_andrew::output_ranges(const container_type&, const container_type&, OutputIterator, bool) [with OutputIterator = boost::geometry::range::back_insert_iterator, true, true, std::vector, std::allocator> >; InputPoint = boost::geometry::model::d2::point_xy; container_type = std::vector, std::allocator > >]' 294 | size_type const count = boost::size(first) + boost::size(second) - 1; | ~~~~~~~~~~~^~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/graham_andrew.hpp:272:26: required from 'static void boost::geometry::detail::convex_hull::graham_andrew::result(const partitions&, OutputIterator, bool, bool) [with OutputIterator = boost::geometry::range::back_insert_iterator, true, true, std::vector, std::allocator> >; InputPoint = boost::geometry::model::d2::point_xy]' 272 | output_ranges(state.m_upper_hull, state.m_lower_hull, out, closed); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/graham_andrew.hpp:171:15: required from 'static void boost::geometry::detail::convex_hull::graham_andrew::apply(const InputProxy&, OutputRing&, Strategy&) [with InputProxy = boost::geometry::detail::convex_hull::input_geometry_proxy > >; OutputRing = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Strategy = const boost::geometry::strategies::convex_hull::cartesian<>; InputPoint = boost::geometry::model::d2::point_xy]' 171 | result(state, | ~~~~~~^~~~~~~ 172 | range::back_inserter(out_ring), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 173 | geometry::point_order::value == clockwise, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 174 | geometry::closure::value != open); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:217:21: required from 'static void boost::geometry::dispatch::convex_hull::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::ring, true, true, std::vector, std::allocator>; Strategy = boost::geometry::strategies::convex_hull::cartesian<>; Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 214 | detail::convex_hull::graham_andrew | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 215 | < | ~ 216 | point_type_t | ~~~~~~~~~~~~~~~~~~~~~~ 217 | >::apply(in_proxy, out, strategy); | ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:334:47: required from 'static void boost::geometry::dispatch::convex_hull_out::apply(const Geometry&, OutputGeometry&, const Strategies&) [with Geometry = boost::geometry::model::multi_point >; Strategies = boost::geometry::strategies::convex_hull::cartesian<>; OutputGeometry = boost::geometry::model::polygon >]' 334 | dispatch::convex_hull::apply(geometry, ring, strategies); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:524:57: required from 'static void boost::geometry::resolve_strategy::convex_hull::apply(const Geometry&, OutputGeometry&, const boost::geometry::default_strategy&) [with Geometry = boost::geometry::model::multi_point >; OutputGeometry = boost::geometry::model::polygon >]' 524 | dispatch::convex_hull_out::apply(geometry, out, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:547:55: required from 'static void boost::geometry::resolve_dynamic::convex_hull::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::polygon >; Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 547 | resolve_strategy::convex_hull::apply(geometry, out, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >; Strategy = default_strategy]' 594 | resolve_dynamic::convex_hull::apply(geometry, out, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >]' 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); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, std::allocator > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]': D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]' 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept, std::allocator > > >' 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::SinglePassRangeConcept, std::allocator > > >]' 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied, std::allocator > > > >::value' 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied, std::allocator > > > >' 45 | typedef boost::integral_constant type; | ^~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:334:47: required from 'static void boost::geometry::dispatch::convex_hull_out::apply(const Geometry&, OutputGeometry&, const Strategies&) [with Geometry = boost::geometry::model::multi_point >; Strategies = boost::geometry::strategies::convex_hull::cartesian<>; OutputGeometry = boost::geometry::model::polygon >]' 334 | dispatch::convex_hull::apply(geometry, ring, strategies); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:524:57: required from 'static void boost::geometry::resolve_strategy::convex_hull::apply(const Geometry&, OutputGeometry&, const boost::geometry::default_strategy&) [with Geometry = boost::geometry::model::multi_point >; OutputGeometry = boost::geometry::model::polygon >]' 524 | dispatch::convex_hull_out::apply(geometry, out, strategy_type()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/geometry/algorithms/detail/convex_hull/interface.hpp:547:55: required from 'static void boost::geometry::resolve_dynamic::convex_hull::apply(const Geometry&, OutputGeometry&, const Strategy&) [with OutputGeometry = boost::geometry::model::polygon >; Strategy = boost::geometry::default_strategy; Geometry = boost::geometry::model::multi_point >; Tag = boost::geometry::multi_point_tag]' 547 | resolve_strategy::convex_hull::apply(geometry, out, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >; Strategy = default_strategy]' 594 | resolve_dynamic::convex_hull::apply(geometry, out, strategy); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/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 >; OutputGeometry = model::polygon >]' 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); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ D:/RCompile/CRANpkg/lib/4.6/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, std::allocator > >]' 37 | ~model() | ^ D:/RCompile/CRANpkg/lib/4.6/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"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/ANN.cpp -o libgeoda/knn/ANN.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/perf.cpp -o libgeoda/knn/perf.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_util.cpp -o libgeoda/knn/kd_util.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_tree.cpp -o libgeoda/knn/kd_tree.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_split.cpp -o libgeoda/knn/kd_split.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_search.cpp -o libgeoda/knn/kd_search.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_pr_search.cpp -o libgeoda/knn/kd_pr_search.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_fix_rad_search.cpp -o libgeoda/knn/kd_fix_rad_search.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/kd_dump.cpp -o libgeoda/knn/kd_dump.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/brute.cpp -o libgeoda/knn/brute.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/bd_tree.cpp -o libgeoda/knn/bd_tree.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/bd_search.cpp -o libgeoda/knn/bd_search.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/bd_pr_search.cpp -o libgeoda/knn/bd_pr_search.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c libgeoda/knn/bd_fix_rad_search.cpp -o libgeoda/knn/bd_fix_rad_search.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c rcpp_rgeoda.cpp -o rcpp_rgeoda.o g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c rcpp_weights.cpp -o rcpp_weights.o 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::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 48 | for (int i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 57 | for (int i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 79 | for (int i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 88 | for (int i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 261 | for (int i=0; i::size_type' {aka 'long long unsigned int'} [-Wsign-compare] 280 | for (int i=0; i::size_type' {aka 'long 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::size_type' {aka 'long 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::size_type' {aka 'long 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::size_type' {aka 'long 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::size_type' {aka 'long 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::size_type' {aka 'long long unsigned int'} and 'int' [-Wsign-compare] 350 | if (raw_bound.size() == num_obs) { | ~~~~~~~~~~~~~~~~~^~~~~~~~~~ g++ -std=gnu++17 -I"D:/RCompile/recent/R/include" -DNDEBUG -I./libgeoda -D__USE_PTHREAD__ -D__RGEODA__ -I'D:/RCompile/CRANpkg/lib/4.6/Rcpp/include' -I'D:/RCompile/CRANpkg/lib/4.6/BH/include' -I"d:/rtools45/x86_64-w64-mingw32.static.posix/include" -O2 -Wall -mfpmath=sse -msse2 -mstackrealign -c RcppExports.cpp -o RcppExports.o g++ -shared -s -static-libgcc -o rgeoda.dll tmp.def ./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/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 -L/lib-14.2.0/x64 -L/lib/x64 -pthread -Ld:/rtools45/x86_64-w64-mingw32.static.posix/lib/x64 -Ld:/rtools45/x86_64-w64-mingw32.static.posix/lib -LD:/RCompile/recent/R/bin/x64 -lR make[1]: Leaving directory '/d/temp/2025_07_15_01_50_00_18950/RtmpQxPZ7G/R.INSTALL2a47822374fc8/rgeoda/src' make[1]: Entering directory '/d/temp/2025_07_15_01_50_00_18950/RtmpQxPZ7G/R.INSTALL2a47822374fc8/rgeoda/src' make[1]: Leaving directory '/d/temp/2025_07_15_01_50_00_18950/RtmpQxPZ7G/R.INSTALL2a47822374fc8/rgeoda/src' installing to d:/Rcompile/CRANpkg/lib/4.6/00LOCK-rgeoda/00new/rgeoda/libs/x64 ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * MD5 sums packaged installation of 'rgeoda' as rgeoda_0.1.0.zip * DONE (rgeoda)