* using log directory ‘/srv/hornik/tmp/CRAN/emstreeR.Rcheck’ * using R Under development (unstable) (2023-11-07 r85491) * using platform: x86_64-pc-linux-gnu * R was compiled by Debian clang version 16.0.6 (16) GNU Fortran (Debian 13.2.0-5) 13.2.0 * running under: Debian GNU/Linux trixie/sid * using session charset: UTF-8 * checking for file ‘emstreeR/DESCRIPTION’ ... OK * checking extension type ... Package * this is package ‘emstreeR’ version ‘3.1.1’ * package encoding: UTF-8 * checking CRAN incoming feasibility ... [4s/5s] NOTE Maintainer: ‘Allan Quadros ’ Possibly misspelled words in DESCRIPTION: shapefiles (18:109) * checking package namespace information ... OK * checking package dependencies ... OK * checking if this is a source package ... OK * checking if there is a namespace ... OK * checking for executable files ... OK * checking for hidden files and directories ... OK * checking for portable file names ... OK * checking for sufficient/correct file permissions ... OK * checking whether package ‘emstreeR’ can be installed ... [2s/2s] OK * checking package directory ... OK * checking for future file timestamps ... OK * checking DESCRIPTION meta-information ... OK * checking top-level files ... OK * checking for left-over files ... OK * checking index information ... OK * checking package subdirectories ... OK * checking R files for non-ASCII characters ... OK * checking R files for syntax errors ... OK * checking whether the package can be loaded ... [0s/0s] OK * checking whether the package can be loaded with stated dependencies ... [0s/0s] OK * checking whether the package can be unloaded cleanly ... [0s/0s] OK * checking whether the namespace can be loaded with stated dependencies ... [0s/0s] OK * checking whether the namespace can be unloaded cleanly ... [0s/0s] OK * checking loading without being on the library search path ... [0s/0s] OK * checking whether startup messages can be suppressed ... [0s/0s] OK * checking use of S3 registration ... OK * checking dependencies in R code ... OK * checking S3 generic/method consistency ... OK * checking replacement functions ... OK * checking foreign function calls ... OK * checking R code for possible problems ... [3s/3s] OK * checking Rd files ... [0s/0s] NOTE checkRd: (-1) emstreeR-package.Rd:14: Lost braces; missing escapes or markup? 14 | This package relies on the R API for {mlpack} - the C++ Machine Learning Library (Curtin et. al., 2013). \pkg{emstreeR} uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, ), which is theoretically and empirically the fastest algorithm for computing an EMST. This package also provides functions and an S3 method for readily plotting Minimum Spanning Trees (MST) using either the style of the {base}, {scatterplot3d}, or {ggplot2} libraries; and functions to export the MST output to shapefiles. | ^ checkRd: (-1) emstreeR-package.Rd:14: Lost braces; missing escapes or markup? 14 | This package relies on the R API for {mlpack} - the C++ Machine Learning Library (Curtin et. al., 2013). \pkg{emstreeR} uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, ), which is theoretically and empirically the fastest algorithm for computing an EMST. This package also provides functions and an S3 method for readily plotting Minimum Spanning Trees (MST) using either the style of the {base}, {scatterplot3d}, or {ggplot2} libraries; and functions to export the MST output to shapefiles. | ^ checkRd: (-1) emstreeR-package.Rd:14: Lost braces; missing escapes or markup? 14 | This package relies on the R API for {mlpack} - the C++ Machine Learning Library (Curtin et. al., 2013). \pkg{emstreeR} uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, ), which is theoretically and empirically the fastest algorithm for computing an EMST. This package also provides functions and an S3 method for readily plotting Minimum Spanning Trees (MST) using either the style of the {base}, {scatterplot3d}, or {ggplot2} libraries; and functions to export the MST output to shapefiles. | ^ checkRd: (-1) emstreeR-package.Rd:14: Lost braces; missing escapes or markup? 14 | This package relies on the R API for {mlpack} - the C++ Machine Learning Library (Curtin et. al., 2013). \pkg{emstreeR} uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, ), which is theoretically and empirically the fastest algorithm for computing an EMST. This package also provides functions and an S3 method for readily plotting Minimum Spanning Trees (MST) using either the style of the {base}, {scatterplot3d}, or {ggplot2} libraries; and functions to export the MST output to shapefiles. | ^ * checking Rd metadata ... OK * checking Rd line widths ... OK * checking Rd cross-references ... OK * checking for missing documentation entries ... OK * checking for code/documentation mismatches ... OK * checking Rd \usage sections ... OK * checking Rd contents ... OK * checking for unstated dependencies in examples ... OK * checking examples ... [1s/1s] OK * checking PDF version of manual ... [3s/3s] OK * checking HTML version of manual ... [0s/0s] OK * checking for non-standard things in the check directory ... OK * checking for detritus in the temp directory ... OK * DONE Status: 2 NOTEs