checkRd: (-1) XWXd.Rd:45: Lost braces
    45 | \code{X} can be a list of sparse matrices of class \code{"dgCMatrix"}, in which case reverse indices are needed, mapping stored matrix rows to rows in the full matrix (that is the reverse of \code{k} which maps full matrix rows to the stored unique matrix rows). \code{r} is the same dimension as \code{k} while \code{off} is a list with as many elements as \code{k} has columns. \code{r} and  \code{off} are supplied as attributes to \code{X} . For simplicity let \code{r} and code{off} denote a single column and element corresponding to each other: then code{r[off[j]:(off[j+1]-1)]} contains the rows of the full matrix corresponding to row \code{j} of the stored matrix. The reverse indices are essential for efficient computation with sparse matrices. See the example code for how to create them efficiently from the forward index matrix, \code{k}.    
       |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   ^
checkRd: (-1) XWXd.Rd:45: Lost braces
    45 | \code{X} can be a list of sparse matrices of class \code{"dgCMatrix"}, in which case reverse indices are needed, mapping stored matrix rows to rows in the full matrix (that is the reverse of \code{k} which maps full matrix rows to the stored unique matrix rows). \code{r} is the same dimension as \code{k} while \code{off} is a list with as many elements as \code{k} has columns. \code{r} and  \code{off} are supplied as attributes to \code{X} . For simplicity let \code{r} and code{off} denote a single column and element corresponding to each other: then code{r[off[j]:(off[j+1]-1)]} contains the rows of the full matrix corresponding to row \code{j} of the stored matrix. The reverse indices are essential for efficient computation with sparse matrices. See the example code for how to create them efficiently from the forward index matrix, \code{k}.    
       |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  ^
checkRd: (-1) blas.thread.test.Rd:18: Lost braces
    18 | A multi-threaded BLAS is often no faster than a single-threaded BLAS, while judicious use of threading in the code calling the BLAS can still deliver a modest speed improvement. For this reason it is often better to use a single threaded BLAS and the code{nthreads} options to \code{\link{bam}} or \code{\link{gam}}. For \code{bam(...,discrete=TRUE)} using several threads can be a substantial benefit, especially with the reference BLAS.
       |                                                                                                                                                                                                                                                                ^
checkRd: (-1) gam.Rd:129: Lost braces
   129 | \item{gamma}{Increase this beyond 1 to produce smoother models. \code{gamma} multiplies the effective degrees of freedom in the GCV or UBRE/AIC. code{n/gamma} can be viewed as an effective sample size in the GCV score, and this also enables it to be used with REML/ML. Ignored with P-RE/ML or the \code{efs} optimizer. } 
       |                                                                                                                                                      ^
checkRd: (-1) gam.mh.Rd:15: Lost braces
    15 |  \item{burn}{the length of any initial burn in period to discard (in addition to code{ns}).}
       |                                                                                      ^
checkRd: (-1) smooth.construct.so.smooth.spec.Rd:47: Lost braces in \itemize; meant \describe ?
checkRd: (-1) smooth.construct.so.smooth.spec.Rd:48: Lost braces in \itemize; meant \describe ?
checkRd: (-1) smooth.construct.so.smooth.spec.Rd:49: Lost braces in \itemize; meant \describe ?
checkRd: (-1) smooth.construct.so.smooth.spec.Rd:64-66: Lost braces in \itemize; meant \describe ?
checkRd: (-1) smooth.construct.so.smooth.spec.Rd:67: Lost braces in \itemize; meant \describe ?
checkRd: (-1) smooth.construct.so.smooth.spec.Rd:68: Lost braces in \itemize; meant \describe ?
checkRd: (-1) smooth.terms.Rd:54-57: Lost braces
    54 | \item{B-splines}{\code{bs="bs"}}{
       |                                 ^
checkRd: (-1) trind.generator.Rd:30: Lost braces; missing escapes or markup?
    30 |           appropriate \code{m} for unrestricted indices. \code{i3} and {i2} do the same 
       |                                                                        ^