The R Project SVN R

/*
 *  R : A Computer Language for Statistical Data Analysis
 *  Copyright (C) 1995, 1996  Robert Gentleman and Ross Ihaka
 *  Copyright (C) 1997--2003  The R Development Core Team.
 *  Copyright (C) 2003        The R Foundation
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 *
 * Object Formatting
 *
 *  See ./paste.c for do_paste() , do_format() and  do_formatinfo()
 *  See ./printutils.c for general remarks on Printing and the Encode.. utils.
 *  See ./print.c  for do_printdefault, do_prmatrix, etc.
 *
 * Exports
 *  formatString
 *  formatLogical
 *  formatFactor
 *  formatInteger
 *  formatReal
 *  formatComplex
 *
 * These  formatFOO() functions determine the proper width, digits, etc.
 */

#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include <Defn.h>
#include <Rmath.h>
#include <Print.h>

/* this is just for conformity with other types */
void formatRaw(Rbyte *x, int n, int *fieldwidth)
{
    *fieldwidth = 2;
}

void formatString(SEXP *x, int n, int *fieldwidth, int quote)
{
    int xmax = 0;
    int i, l;

    for (i = 0; i < n; i++) {
    if (x[i] == NA_STRING) {
        l = quote ? R_print.na_width : R_print.na_width_noquote;
    } else l = Rstrlen(x[i], quote) + (quote ? 2 : 0);
    if (l > xmax) xmax = l;
    }
    *fieldwidth = xmax;
}

void formatLogical(int *x, int n, int *fieldwidth)
{
    int i;

    *fieldwidth = 1;
    for(i = 0 ; i < n; i++) {
    if (x[i] == NA_LOGICAL) {
        if(*fieldwidth < R_print.na_width)
        *fieldwidth =  R_print.na_width;
    } else if (x[i] != 0 && *fieldwidth < 4) {
        *fieldwidth = 4;
    } else if (x[i] == 0 && *fieldwidth < 5 ) {
        *fieldwidth = 5;
        break;
        /* this is the widest it can be,  so stop */
    }
    }
}

void formatFactor(int *x, int n, int *fieldwidth, SEXP levels, int nlevs)
{
    int xmax = INT_MIN, naflag = 0;
    int i, l = 0;

    if(isNull(levels)) {
    for(i=0 ; i<n ; i++) {
        if (x[i] == NA_INTEGER || x[i] < 1 || x[i] > nlevs)
        naflag = 1;
        else if (x[i] > xmax)
        xmax = x[i];
    }
    if (xmax > 0)
        l = IndexWidth(xmax);
    }
    else {
    l = 0;
    for(i=0 ; i<n ; i++) {
        if (x[i] == NA_INTEGER || x[i] < 1 || x[i] > nlevs)
        naflag = 1;
        else {
        xmax = strlen(CHAR(STRING_ELT(levels, x[i]-1)));
        if (xmax > l) l = xmax;
        }
    }
    }
    if (naflag) *fieldwidth = R_print.na_width;
    else *fieldwidth = 1;
    if (l > *fieldwidth) *fieldwidth = l;
}

void formatInteger(int *x, int n, int *fieldwidth)
{
    int xmin = INT_MAX, xmax = INT_MIN, naflag = 0;
    int i, l;

    for (i = 0; i < n; i++) {
    if (x[i] == NA_INTEGER)
        naflag = 1;
    else {
        if (x[i] < xmin) xmin = x[i];
        if (x[i] > xmax) xmax = x[i];
    }
    }

    if (naflag) *fieldwidth = R_print.na_width;
    else *fieldwidth = 1;

    if (xmin < 0) {
    l = IndexWidth(-xmin) + 1;  /* +1 for sign */
    if (l > *fieldwidth) *fieldwidth = l;
    }
    if (xmax > 0) {
    l = IndexWidth(xmax);
    if (l > *fieldwidth) *fieldwidth = l;
    }
}

/*---------------------------------------------------------------------------
 * scientific format determination for real numbers.
 * This is time-critical code.   It is worth optimizing.
 *
 *    nsig      digits altogether
 *    kpower+1      digits to the left of "."
 *    kpower+1+sgn  including sign
 *
 * Using GLOBAL  R_print.digits  -- had  #define MAXDIG R_print.digits
*/

static const double tbl[] =
{
    0.e0, 1.e0, 1.e1, 1.e2, 1.e3, 1.e4, 1.e5, 1.e6, 1.e7, 1.e8, 1.e9
};

static void scientific(double *x, int *sgn, int *kpower, int *nsig, double eps)
{
    /* for a number x , determine
     *  sgn    = 1_{x < 0}  {0/1}
     *  kpower = Exponent of 10;
     *  nsig   = min(R_print.digits, #{significant digits of alpha})
     *
     * where  |x| = alpha * 10^kpower   and  1 <= alpha < 10
     */
    register double alpha;
    register double r;
    register int kp;
    int j;

    if (*x == 0.0) {
    *kpower = 0;
    *nsig = 1;
    *sgn = 0;
    }
    else {
    if(*x < 0.0) {
        *sgn = 1; r = -*x;
    } else {
        *sgn = 0; r = *x;
    }
    kp = floor(log10(r));/*-->   r = |x| ;  10^k <= r */
    if (abs(kp) < 10) {
        if (kp >= 0)
        alpha = r / tbl[kp + 1]; /* division slow ? */
        else
        alpha = r * tbl[-kp + 1];
    }
    /* on IEEE 1e-308 is not representable except by gradual underflow.
       shifting by 30 allows for any potential denormalized numbers x,
       and makes the reasonable assumption that R_dec_min_exponent+30
       is in range.
     */
    else if (kp <= R_dec_min_exponent) {
        alpha = (r * 1e+30)/pow(10.0, (double)(kp+30));
    }
    else
        alpha = r / pow(10.0, (double)kp);

    /* make sure that alpha is in [1,10) AFTER rounding */

    if (10.0 - alpha < eps*alpha) {
        alpha /= 10.0;
        kp += 1;
    }
    *kpower = kp;

    /* compute number of digits */

    *nsig = R_print.digits;
    for (j=1; j <= *nsig; j++) {
        if (fabs(alpha - floor(alpha+0.5)) < eps * alpha) {
        *nsig = j;
        break;
        }
        alpha *= 10.0;
    }
    }
}

void formatReal(double *x, int l, int *m, int *n, int *e, int nsmall)
{
    int left, right, sleft;
    int mnl, mxl, rgt, mxsl, mxns, mF;
    int neg, sgn, kpower, nsig;
    int i, naflag, nanflag, posinf, neginf;

    double eps = pow(10.0, -(double)R_print.digits);

    nanflag = 0;
    naflag = 0;
    posinf = 0;
    neginf = 0;
    neg = 0;
    rgt = mxl = mxsl = mxns = INT_MIN;
    mnl = INT_MAX;

    for (i=0; i<l; i++) {
    if (!R_FINITE(x[i])) {
        if(ISNA(x[i])) naflag = 1;
        else if(ISNAN(x[i])) nanflag = 1;
        else if(x[i] > 0) posinf = 1;
        else neginf = 1;
    } else {
        scientific(&x[i], &sgn, &kpower, &nsig, eps);

        left = kpower + 1;
        sleft = sgn + ((left <= 0) ? 1 : left); /* >= 1 */
        right = nsig - left; /* #{digits} right of '.' ( > 0 often)*/
        if (sgn) neg = 1;    /* if any < 0, need extra space for sign */

        /* Infinite precision "F" Format : */
        if (right > rgt) rgt = right;   /* max digits to right of . */
        if (left > mxl)  mxl = left;    /* max digits to  left of . */
        if (left < mnl)  mnl = left;    /* min digits to  left of . */
        if (sleft> mxsl) mxsl = sleft;  /* max left including sign(s)*/
        if (nsig > mxns) mxns = nsig;   /* max sig digits */
    }
    }
    /* F Format: use "F" format WHENEVER we use not more space than 'E'
     *      and still satisfy 'R_print.digits' {but as if nsmall==0 !}
     *
     * E Format has the form   [S]X[.XXX]E+XX[X]
     *
     * This is indicated by setting *e to non-zero (usually 1)
     * If the additional exponent digit is required *e is set to 2
     */

    /*-- These  'mxsl' & 'rgt'  are used in F Format
     *   AND in the ____ if(.) "F" else "E" ___   below: */
    if (mxl < 0) mxsl = 1 + neg;

    /* use nsmall only *after* comparing "F" vs "E": */
    if (rgt < 0) rgt = 0;
    mF = mxsl + rgt + (rgt != 0);   /* width m for F  format */

    /*-- 'see' how "E" Exponential format would be like : */
    if (mxl > 100 || mnl <= -99) *e = 2;/* 3 digit exponent */
    else *e = 1;
    *n = mxns - 1;
    *m = neg + (*n > 0) + *n + 4 + *e; /* width m for E  format */

    if (mF <= *m  + R_print.scipen) { /* Fixpoint if it needs less space */
    *e = 0;
    if (nsmall > rgt) {
        rgt = nsmall;
        mF = mxsl + rgt + (rgt != 0);
    }
    *n = rgt;
    *m = mF;
    } /* else : "E" Exponential format -- all done above */
    if (naflag && *m < R_print.na_width)
    *m = R_print.na_width;
    if (nanflag && *m < 3) *m = 3;
    if (posinf && *m < 3) *m = 3;
    if (neginf && *m < 4) *m = 4;
}


void formatComplex(Rcomplex *x, int l, int *mr, int *nr, int *er,
           int *mi, int *ni, int *ei, int nsmall)
{
/* format.info() or  x[1..l] for both Re & Im */
    int left, right, sleft;
    int rt, mnl, mxl, mxsl, mxns, mF;
    int i_rt, i_mnl, i_mxl, i_mxsl, i_mxns;
    int neg, sgn;
    int i, kpower, nsig;
    int naflag;
    int rnanflag, rposinf, rneginf, inanflag, iposinf;

    double eps = pow(10.0, -(double)R_print.digits);

    naflag = 0;
    rnanflag = 0;
    rposinf = 0;
    rneginf = 0;
    inanflag = 0;
    iposinf = 0;
    neg = 0;

    rt  =  mxl =  mxsl =  mxns = INT_MIN;
    i_rt= i_mxl= i_mxsl= i_mxns= INT_MIN;
    i_mnl = mnl = INT_MAX;

    for (i=0; i<l; i++) {

    if(ISNA(x[i].r) || ISNA(x[i].i)) {
        naflag = 1;
    }
    else {

        /* real part */

        if(!R_FINITE(x[i].r)) {
        if (ISNAN(x[i].r)) rnanflag = 1;
        else if (x[i].r > 0) rposinf = 1;
        else rneginf = 1;
        }
        else
          {
        scientific(&(x[i].r), &sgn, &kpower, &nsig, eps);

        left = kpower + 1;
        sleft = sgn + ((left <= 0) ? 1 : left); /* >= 1 */
        right = nsig - left; /* #{digits} right of '.' ( > 0 often)*/
        if (sgn) neg = 1; /* if any < 0, need extra space for sign */

        if (right > rt) rt = right; /* max digits to right of . */
        if (left > mxl) mxl = left; /* max digits to left of . */
        if (left < mnl) mnl = left; /* min digits to left of . */
        if (sleft> mxsl) mxsl = sleft;  /* max left including sign(s) */
        if (nsig > mxns) mxns = nsig;   /* max sig digits */

        }
        /* imaginary part */

        /* this is always unsigned */
        /* we explicitly put the sign in when we print */

        if(!R_FINITE(x[i].i)) {
        if (ISNAN(x[i].i)) inanflag = 1;
        else iposinf = 1;
        }
        else
          {
        scientific(&(x[i].i), &sgn, &kpower, &nsig, eps);

        left = kpower + 1;
        sleft = ((left <= 0) ? 1 : left);
        right = nsig - left;

        if (right > i_rt) i_rt = right;
        if (left > i_mxl) i_mxl = left;
        if (left < i_mnl) i_mnl = left;
        if (sleft> i_mxsl) i_mxsl = sleft;
        if (nsig > i_mxns) i_mxns = nsig;
        }
        /* done: ; */
    }
    }

    /* see comments in formatReal() for details on this */

    /* overall format for real part */

    if (mxl != INT_MIN) {
    if (mxl < 0) mxsl = 1 + neg;
    if (rt < 0) rt = 0;
    mF = mxsl + rt + (rt != 0);

    if (mxl > 100 || mnl < -99) *er = 2;
    else *er = 1;
    *nr = mxns - 1;
    *mr = neg + (*nr > 0) + *nr + 4 + *er;
        if (mF <= *mr + R_print.scipen) { /* Fixpoint if it needs less space */
        *er = 0;
        if (nsmall > rt) {
        rt = nsmall;
        mF = mxsl + rt + (rt != 0);
        }
        *nr = rt;
        *mr = mF;
    }
    }
    else {
    *er = 0;
    *mr = 0;
    *nr = 0;
    }
    if (rnanflag && *mr < 3) *mr = 3;
    if (rposinf && *mr < 3) *mr = 3;
    if (rneginf && *mr < 4) *mr = 4;

    /* overall format for imaginary part */

    if (i_mxl != INT_MIN) {
    if (i_mxl < 0) i_mxsl = 1;
    if (i_rt < 0) i_rt = 0;
    mF = i_mxsl + i_rt + (i_rt != 0);

    if (i_mxl > 100 || i_mnl < -99) *ei = 2;
    else *ei = 1;
    *ni = i_mxns - 1;
    *mi = (*ni > 0) + *ni + 4 + *ei;
        if (mF <= *mi + R_print.scipen) { /* Fixpoint if it needs less space */
        *ei = 0;
        if (nsmall > i_rt) {
        i_rt = nsmall;
        mF = mxsl + i_rt + (i_rt != 0);
        }
        *ni = i_rt;
        *mi = mF;
    }
    }
    else {
    *ei = 0;
    *mi = 0;
    *ni = 0;
    }
    if (inanflag && *mi < 3) *mi = 3;
    if (iposinf  && *mi < 3) *mi = 3;
    if(*mr < 0) *mr = 0;
    if(*mi < 0) *mi = 0;

    /* finally, ensure that there is space for NA */

    if (naflag && *mr+*mi+2 < R_print.na_width)
    *mr += (R_print.na_width -(*mr + *mi + 2));
}