CRAN Package Check Results for Package autoMFA

Last updated on 2025-02-23 15:49:36 CET.

Flavor	Version	Tinstall	Tcheck	Ttotal	Status	Flags
r-devel-linux-x86_64-debian-clang	1.0.0	6.93	57.07	64.00	NOTE
r-devel-linux-x86_64-debian-gcc	1.0.0	4.21	38.93	43.14	NOTE
r-devel-linux-x86_64-fedora-clang	1.0.0			104.33	NOTE
r-devel-linux-x86_64-fedora-gcc	1.0.0			104.53	NOTE
r-devel-macos-arm64	1.0.0			36.00	NOTE
r-devel-macos-x86_64	1.0.0			62.00	NOTE
r-devel-windows-x86_64	1.0.0	10.00	71.00	81.00	NOTE
r-patched-linux-x86_64	1.0.0	6.01	53.93	59.94	NOTE
r-release-linux-x86_64	1.0.0	6.07	54.04	60.11	NOTE
r-release-macos-arm64	1.0.0			29.00	NOTE
r-release-macos-x86_64	1.0.0			46.00	NOTE
r-release-windows-x86_64	1.0.0	10.00	69.00	79.00	NOTE
r-oldrel-macos-arm64	1.0.0			34.00	OK
r-oldrel-macos-x86_64	1.0.0			49.00	OK
r-oldrel-windows-x86_64	1.0.0	11.00	81.00	92.00	OK

Check Details

Version: 1.0.0
Check: Rd files
Result: 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 Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-devel-macos-arm64, r-devel-macos-x86_64, r-devel-windows-x86_64, r-patched-linux-x86_64, r-release-linux-x86_64, r-release-macos-arm64, r-release-macos-x86_64, r-release-windows-x86_64

Version: 1.0.0
Check: dependencies in R code
Result: NOTE Namespace in Imports field not imported from: ‘usethis’ All declared Imports should be used. Flavors: r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc