[Vegan-commits] r1121 - in pkg/vegan: inst man

[noreply at r-forge.r-project.org]

Author: jarioksa
Date: 2010-02-09 19:06:48 +0100 (Tue, 09 Feb 2010)
New Revision: 1121

Modified:
   pkg/vegan/inst/ChangeLog
   pkg/vegan/man/permatfull.Rd
Log:
braces & mark-up

Modified: pkg/vegan/inst/ChangeLog
===================================================================
--- pkg/vegan/inst/ChangeLog	2010-02-09 16:30:29 UTC (rev 1120)
+++ pkg/vegan/inst/ChangeLog	2010-02-09 18:06:48 UTC (rev 1121)
@@ -13,6 +13,8 @@
 	predict.rda() or predict.rda(). This also allows simulation under
 	null model by setting rank = 0.
 
+	* permatfull.Rd: fixed braces in the help file + mark-up.
+
 Version 1.18-0 (closeed January 11, 2010 with release 1.17-0)
 
 	* Documented na.action in cca.object.

Modified: pkg/vegan/man/permatfull.Rd
===================================================================
--- pkg/vegan/man/permatfull.Rd	2010-02-09 16:30:29 UTC (rev 1120)
+++ pkg/vegan/man/permatfull.Rd	2010-02-09 18:06:48 UTC (rev 1121)
@@ -106,7 +106,7 @@
   The 'quasiswapcount' algorithm (\code{method="quasiswap"} and
   \code{mtype="count"}) uses the same trick as Carsten Dormann's
   \code{\link[bipartite]{swap.web}} function in the package
-  \pkg[bipartite}. First, a random matrix is generated by the
+  \pkg{bipartite}. First, a random matrix is generated by the
   \code{\link{r2dtable}} function retaining row and column sums. Then
   the original matrix fill is reconstructed by sequential steps to
   increase or decrease matrix fill in the random matrix. These steps are
@@ -114,10 +114,10 @@
   details) to maintain row and column totals. This algorithm generates
   independent matrices in each step, so \code{burnin} and \code{thin}
   arguments are not considered. This is the default method, because this
-  is not sequential (as 'swapcount' is) so independence of subsequent
+  is not sequential (as \code{swapcount} is) so independence of subsequent
   matrices does not have to be checked.
 
-  The 'swapcount' algorithm (\code{method="swap"} and
+  The \code{swapcount} algorithm (\code{method="swap"} and
   \code{mtype="count"}) tries to find 2x2 submatrices (identified by 2
   random row and 2 random column indices), that can be swapped in order
   to leave column and row totals and fill unchanged. First, the