resolve PR#18902, typos in /stats/, incl in some msgs

git-svn-id: https://svn.r-project.org/R/trunk@88269 00db46b3-68df-0310-9c12-caf00c1e9a41

Author: maechler

src/library/stats/R/addmargins.R

@@ -148,7 +148,7 @@ addmargins <-
 	## First fill in the body of the table
 	values[apos] <- as.vector(A)
 
-	## Then sucessively compute and fill in the required margins
+	## Then successively compute and fill in the required margins
 	for(i in 1L:n.mar) {
 	    mtab <- if(n.dim > 1)
 			apply(A, (1L:n.dim)[-margin], FUN[[i]])

src/library/stats/R/confint.R

@@ -136,7 +136,7 @@ confint.profile.nls <-
   ncoefs <- length(coef(attr(object, "original.fit")))
   of <- attr(object, "original.fit")
   if(is.numeric(parm))  parm <- pnames[parm]
-  ## drop any plinear paramaters
+  ## drop any plinear parameters
   parm <- parm[parm %in% pnames]
   n <- length(fitted(of)) - length(of$m$getPars())
   a <- (1-level)/2

src/library/stats/R/glm.R

@@ -711,7 +711,7 @@ summary.glm <- function(object, dispersion = NULL,
     if (p > 0) {
         p1 <- 1L:p
 	Qr <- qr.lm(object)
-        ## WATCHIT! doesn't this rely on pivoting not permuting 1L:p? -- that's quaranteed
+        ## WATCHIT! doesn't this rely on pivoting not permuting 1L:p? -- that's guaranteed
         coef.p <- object$coefficients[Qr$pivot[p1]]
         covmat.unscaled <- chol2inv(Qr$qr[p1,p1,drop=FALSE])
         dimnames(covmat.unscaled) <- list(names(coef.p),names(coef.p))

src/library/stats/R/smspline.R

@@ -243,7 +243,7 @@ smooth.spline <-
 	## parms :  c(low = , high = , tol = , eps = )
 	list(x = ux, y = fit$ty, w = wbar, yin = ybar, tol = tol,
 	     data = if(keep.data) list(x = x, y = y, w = w), no.weights = no.wgts,
-	     n = n, # to reliablly know (when keep.data is false) if (nx < n)
+	     n = n, # to reliably know (when keep.data is false) if (nx < n)
 	     lev = lev,
 	     cv = cv,
 	     cv.crit = cv.crit, pen.crit = sum(wbar * (ybar - fit$ty)^2),

src/library/stats/man/optim.Rd

@@ -194,7 +194,7 @@ optimHess(par, fn, gr = NULL, \dots, control = list())
   be shared between calls: the function should not change or copy it.
 }
 %% when numerical derivatives are used, fn is called repeatedly with
-%% modified copies of the same objet.
+%% modified copies of the same object.
 
 \value{
   For \code{optim}, a list with components:

src/library/stats/src/fexact.c

@@ -455,7 +455,7 @@ f2xact(int nrow, int ncol, const int table[], int ldtabl,
     } else
 	nro = nrow;
 
-    /* Get multiplers for stack */
+    /* Get multipliers for stack */
     kyy[1] = 1;
     for (i = 1; i < nro; ++i) {
 	/* Hash table multipliers */
@@ -1508,7 +1508,7 @@ f6xact(int nrow, int *irow, const int kyy[], int *key, int ldkey, int *last, int
     NROW    - The number of rows in the table.			(Input)
     IROW    - Vector of length nrow containing the row sums on
 	      output.						(Output)
-    KYY     - Constant mutlipliers used in forming the hash
+    KYY     - Constant multipliers used in forming the hash
 	      table key.					(Input)
     KEY     - Vector of length LDKEY containing the hash table
 	      keys.						(in/output)

src/library/stats/src/fft.c

@@ -44,7 +44,7 @@
  *	maxf and maxp which determine the amount of scratch storage
  *	required by the algorithm.
  *
- *	If maxf is zero on return, an error occured during factorization.
+ *	If maxf is zero on return, an error occurred during factorization.
  *	The nature of the error can be determined from the value of maxp.
  *	If maxp is zero, an invalid (zero) parameter was passed and
  *	if maxp is one,	 the internal nfac array was too small.	 This can only

src/library/stats/src/ks.c

@@ -172,7 +172,7 @@ K2l(double x, int lower, double tol)
 
    for i + j < m + n.
 
-   We actually recusively compute
+   We actually recursively compute
 
      p_{i,j} = A_{i,j} / choose(i + n, i)
 
@@ -216,7 +216,7 @@ SEXP psmirnov_exact(SEXP sq, SEXP sm, SEXP sn, SEXP sz,
     for(i = 0; i < LENGTH(sq); i++) {
 	q = REAL(sq)[i];
 	/*
-	  q has about 0.5/mn substracted to ensure that rounding error
+	  q has about 0.5/mn subtracted to ensure that rounding error
 	  doesn't turn an equality into an inequality.
 	*/
 	q = (0.5 + floor(q * md * nd - 1e-7)) / (md * nd);

src/library/stats/src/loessc.c

@@ -388,7 +388,7 @@ switch(*i){
  case 180:MSG("nv>nvmax in cpvert.")
  case 181:MSG("nt>20 in eval.")
  case 182:MSG("svddc failed in l2fit.")
- case 183:MSG("didnt find edge in vleaf.")
+ case 183:MSG("didn't find edge in vleaf.")
  case 184:MSG("zero-width cell found in vleaf.")
  case 185:MSG("trouble descending to leaf in vleaf.")
  case 186:MSG("insufficient workspace for lowesf.")

src/library/stats/src/model.c

@@ -2041,7 +2041,7 @@ SEXP termsform(SEXP args)
 	R_xlen_t l = 0;
 #ifdef DEBUG_terms
 	Rprintf("  st.5: (bitpattern in int) term: "); printVector(CAR(call), 0, 0);
-	Rprintf("  ----  {not tracing GetBit() when determing 'cbuf' length}\n");
+	Rprintf("  ----  {not tracing GetBit() when determining 'cbuf' length}\n");
 	trace_GetBit = false; // *not* tracing below
 #endif
 	for (int i = 1; i <= nvar; i++) {