• using R Under development (unstable) (2024-12-10 r87437)
• using platform: x86_64-pc-linux-gnu
• R was compiled by     clang version 19.1.5     flang-new version 19.1.5
• running under: Fedora Linux 36 (Workstation Edition)
• using session charset: UTF-8
• using option ‘--no-stop-on-test-error’
• checking for file ‘autoMFA/DESCRIPTION’ ... OK
• this is package ‘autoMFA’ version ‘1.0.0’
• package encoding: UTF-8
• 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 ‘autoMFA’ can be installed ... [12s/15s] OK See the install log for details.
• checking installed package size ... OK
• checking package directory ... 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 code files for non-ASCII characters ... OK
• checking R files for syntax errors ... OK
• checking whether the package can be loaded ... OK
• checking whether the package can be loaded with stated dependencies ... OK
• checking whether the package can be unloaded cleanly ... OK
• checking whether the namespace can be loaded with stated dependencies ... OK
• checking whether the namespace can be unloaded cleanly ... OK
• checking loading without being on the library search path ... OK
• checking use of S3 registration ... OK
• checking dependencies in R code ... NOTE Namespace in Imports field not imported from: ‘usethis’   All declared Imports should be used.
• checking S3 generic/method consistency ... OK
• checking replacement functions ... OK
• checking foreign function calls ... OK
• checking R code for possible problems ... [31s/38s] OK
• checking Rd files ... NOTE checkRd: (-1) AMFA.Rd:37: Lost braces; missing escapes or markup?     37 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.Rd:37: Lost braces; missing escapes or markup?     37 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.Rd:37: Lost braces; missing escapes or markup?     37 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.Rd:37: Lost braces; missing escapes or markup?     37 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.Rd:37: Lost braces; missing escapes or markup?     37 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.Rd:37: Lost braces; missing escapes or markup?     37 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.Rd:45-52: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:46: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:47: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:48: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:49-50: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:51: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:53-57: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:54-55: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:56-57: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:58-62: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:59: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:60: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:61: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.Rd:62: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:30: Lost braces; missing escapes or markup?     30 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.inc.Rd:30: Lost braces; missing escapes or markup?     30 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.inc.Rd:30: Lost braces; missing escapes or markup?     30 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.inc.Rd:30: Lost braces; missing escapes or markup?     30 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.inc.Rd:30: Lost braces; missing escapes or markup?     30 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.inc.Rd:30: Lost braces; missing escapes or markup?     30 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) AMFA.inc.Rd:42-49: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:43: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:44: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:45: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:46-47: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:48: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:50-54: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:51-52: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:53-54: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:55-58: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:56: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:57: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) AMFA.inc.Rd:58: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:43: Lost braces; missing escapes or markup?     43 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) MFA_ECM.Rd:43: Lost braces; missing escapes or markup?     43 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) MFA_ECM.Rd:43: Lost braces; missing escapes or markup?     43 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) MFA_ECM.Rd:43: Lost braces; missing escapes or markup?     43 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) MFA_ECM.Rd:43: Lost braces; missing escapes or markup?     43 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) MFA_ECM.Rd:43: Lost braces; missing escapes or markup?     43 | \item{conv_measure}{The convergence criterion of the ECM algorithm. The default \code{'diff'} stops the ECM iterations if |l^{(k+1)} - l^{(k)}| < \code{tol} where l^{(k)} is the log-likelihood at the \emph{k}th ECM iteration. If \code{'ratio'}, then the convergence of the ECM iterations is measured using |(l^{(k+1)} - l^{(k)})/l^{(k+1)}|.}        | ^ checkRd: (-1) MFA_ECM.Rd:51-58: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:52: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:53: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:54: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:55-56: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:57: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:59-63: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:60-61: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:62-63: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:64-68: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:65: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:66: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:67: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) MFA_ECM.Rd:68: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:25-32: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:26: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:27: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:28: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:29-30: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:31: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:33-37: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:34-35: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:36-37: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:38-45: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:39: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:40: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:41: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:42-43: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:44: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) amofa.Rd:45: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) preprocess.Rd:20: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) preprocess.Rd:21: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:27-34: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:28: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:29: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:30: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:31-32: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:33: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:35-39: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:36-37: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:38-39: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:40-45: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:41: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:42: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:43: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:44: Lost braces in \itemize; \value handles \item{}{} directly checkRd: (-1) vbmfa.Rd:45: Lost braces in \itemize; \value handles \item{}{} directly
• 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 contents of ‘data’ directory ... OK
• checking data for non-ASCII characters ... OK
• checking LazyData ... OK
• checking data for ASCII and uncompressed saves ... OK
• checking examples ... [29s/41s] OK
• checking PDF version of manual ... [7s/10s] OK
• checking HTML version of manual ... OK
• checking for non-standard things in the check directory ... OK
• checking for detritus in the temp directory ... OK
• DONE

Status: 2 NOTEs