| Line 63... |
Line 63... |
| 63 |
}
|
63 |
}
|
| 64 |
\details{
|
64 |
\details{
|
| 65 |
\code{pretty} ignores non-finite values in \code{x}.
|
65 |
\code{pretty} ignores non-finite values in \code{x}.
|
| 66 |
|
66 |
|
| 67 |
Let \code{d <- max(x) - min(x)} \eqn{\ge 0}.
|
67 |
Let \code{d <- max(x) - min(x)} \eqn{\ge 0}.
|
| 68 |
If \code{d} is not (very close) to 0, we let \code{c <- d/n},
|
68 |
If \code{d} is not (very close to) 0, we let \code{c <- d/n},
|
| 69 |
otherwise more or less \code{c <- max(abs(range(x)))*shrink.sml / min.n}.
|
69 |
otherwise more or less \code{c <- max(abs(range(x)))*shrink.sml / min.n}.
|
| 70 |
Then, the \emph{10 base} \code{b} is
|
70 |
Then, the \emph{10 base} \code{b} is
|
| 71 |
\eqn{10^{\lfloor{\log_{10}(c)}\rfloor}}{10^(floor(log10(c)))} such
|
71 |
\eqn{10^{\lfloor{\log_{10}(c)}\rfloor}}{10^(floor(log10(c)))} such
|
| 72 |
that \eqn{b \le c < 10b}.
|
72 |
that \eqn{b \le c < 10b}.
|
| 73 |
|
73 |
|
| Line 87... |
Line 87... |
| 87 |
compatibility reasons, the optional arguments are set, corresponding to
|
87 |
compatibility reasons, the optional arguments are set, corresponding to
|
| 88 |
\preformatted{
|
88 |
\preformatted{
|
| 89 |
(min.n = 1, shrink.sml = 0.25, high.u.bias = 0.8, u5.bias = 1.7,
|
89 |
(min.n = 1, shrink.sml = 0.25, high.u.bias = 0.8, u5.bias = 1.7,
|
| 90 |
f.min = 1.125, eps.correct = 2, bounds = FALSE)}
|
90 |
f.min = 1.125, eps.correct = 2, bounds = FALSE)}
|
| 91 |
}
|
91 |
}
|
| - |
|
92 |
\value{
|
| 92 |
\value{\code{pretty()} returns an numeric vector of \emph{approximately}
|
93 |
\code{pretty()} returns a numeric vector of \emph{approximately}
|
| 93 |
\code{n} increasing numbers which are \dQuote{pretty} in decimal notation.
|
94 |
\code{n} increasing numbers which are \dQuote{pretty} in decimal notation.
|
| 94 |
(in extreme range cases, the numbers can no longer be \dQuote{pretty}
|
95 |
(in extreme range cases, the numbers can no longer be \dQuote{pretty}
|
| 95 |
given the other constraints; e.g., for \code{pretty(..)} % <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< FIXME
|
96 |
given the other constraints; e.g., for \code{pretty(..)} % <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< FIXME
|
| 96 |
For ease of investigating the underlying C \code{R_pretty()} % ../../../appl/pretty.c
|
97 |
For ease of investigating the underlying C \code{R_pretty()} % ../../../appl/pretty.c
|
| 97 |
function, \code{.pretty()} returns a named \code{\link{list}}. By
|
98 |
function, \code{.pretty()} returns a named \code{\link{list}}. By
|
The R Project SVN
R