The R Project SVN R

Rev

Rev 20701 | Rev 29510 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 20701 Rev 20812
Line 74... Line 74...
74 
	    w[j] = clabw;
 74 
	    w[j] = clabw;
75 
	w[j] += R_print.gap;
 75 
	w[j] += R_print.gap;
76 
    }
 76 
    }
77 
    jmin = 0;
 77 
    jmin = 0;
78 
    jmax = 0;
 78 
    jmax = 0;
- 
 
 79 
    if (c == 0) {
- 
 
 80 
	for (i = 0; i < r; i++)
- 
 
 81 
	    MatrixRowLabel(rl, i, rlabw, lbloff);
- 
 
 82 
	Rprintf("\n");
- 
 
 83 
	return;
- 
 
 84 
    }
79 
    while (jmin < c) {
 85 
    while (jmin < c) {
80 
	width = rlabw;
 86 
	width = rlabw;
81 
	do {
 87 
	do {
82 
	    width += w[jmax];
 88 
	    width += w[jmax];
83 
	    jmax++;
 89 
	    jmax++;
Line 143... Line 149...
143 
	    w[j] = clabw;
 149 
	    w[j] = clabw;
144 
	w[j] += R_print.gap;
 150 
	w[j] += R_print.gap;
145 
    }
 151 
    }
146 
    jmin = 0;
 152 
    jmin = 0;
147 
    jmax = 0;
 153 
    jmax = 0;
- 
 
 154 
    if (c == 0) {
- 
 
 155 
	for (i = 0; i < r; i++)
- 
 
 156 
	    MatrixRowLabel(rl, i, rlabw, lbloff);
- 
 
 157 
	Rprintf("\n");
- 
 
 158 
	return;
- 
 
 159 
    }
148 
    while (jmin < c) {
 160 
    while (jmin < c) {
149 
	width = rlabw;
 161 
	width = rlabw;
150 
	do {
 162 
	do {
151 
	    width += w[jmax];
 163 
	    width += w[jmax];
152 
	    jmax++;
 164 
	    jmax++;
Line 219... Line 231...
219 
	    w[j] = clabw;
 231 
	    w[j] = clabw;
220 
	w[j] += R_print.gap;
 232 
	w[j] += R_print.gap;
221 
    }
 233 
    }
222 
    jmin = 0;
 234 
    jmin = 0;
223 
    jmax = 0;
 235 
    jmax = 0;
- 
 
 236 
    if (c == 0) {
- 
 
 237 
	for (i = 0; i < r; i++)
- 
 
 238 
	    MatrixRowLabel(rl, i, rlabw, lbloff);
- 
 
 239 
	Rprintf("\n");
- 
 
 240 
	return;
- 
 
 241 
    }
224 
    while (jmin < c) {
 242 
    while (jmin < c) {
225 
	width = rlabw;
 243 
	width = rlabw;
226 
	do {
 244 
	do {
227 
	    width += w[jmax];
 245 
	    width += w[jmax];
228 
	    jmax++;
 246 
	    jmax++;
Line 309... Line 327...
309 
	w[j] += R_print.gap;
 327 
	w[j] += R_print.gap;
310 
    }
 328 
    }
311 
 
 329 
 
312 
    jmin = 0;
 330 
    jmin = 0;
313 
    jmax = 0;
 331 
    jmax = 0;
- 
 
 332 
    if (c == 0) {
- 
 
 333 
	for (i = 0; i < r; i++)
- 
 
 334 
	    MatrixRowLabel(rl, i, rlabw, lbloff);
- 
 
 335 
	Rprintf("\n");
- 
 
 336 
	return;
- 
 
 337 
    }
314 
    while (jmin < c) {
 338 
    while (jmin < c) {
315 
	width = rlabw;
 339 
	width = rlabw;
316 
	do {
 340 
	do {
317 
	    width += w[jmax];
 341 
	    width += w[jmax];
318 
	    jmax++;
 342 
	    jmax++;
Line 385... Line 409...
385 
	if (w[j] < clabw)
 409 
	if (w[j] < clabw)
386 
	    w[j] = clabw;
 410 
	    w[j] = clabw;
387 
    }
 411 
    }
388 
    jmin = 0;
 412 
    jmin = 0;
389 
    jmax = 0;
 413 
    jmax = 0;
- 
 
 414 
    if (c == 0) {
- 
 
 415 
	for (i = 0; i < r; i++)
- 
 
 416 
	    MatrixRowLabel(rl, i, rlabw, lbloff);
- 
 
 417 
	Rprintf("\n");
- 
 
 418 
	return;
- 
 
 419 
    }
390 
    while (jmin < c) {
 420 
    while (jmin < c) {
391 
	width = rlabw;
 421 
	width = rlabw;
392 
	do {
 422 
	do {
393 
	    width += w[jmax] + R_print.gap;
 423 
	    width += w[jmax] + R_print.gap;
394 
	    jmax++;
 424 
	    jmax++;
Line 433... Line 463...
433 
    /* PR#850 */
 463 
    /* PR#850 */
434 
    if ((rl!=R_NilValue) && (r>length(rl)))
 464 
    if ((rl!=R_NilValue) && (r>length(rl)))
435 
	error("too few row labels");
 465 
	error("too few row labels");
436 
    if ((cl!=R_NilValue) && (c>length(cl)))
 466 
    if ((cl!=R_NilValue) && (c>length(cl)))
437 
	error("too few column labels");
 467 
	error("too few column labels");
- 
 
 468 
    if (r == 0 && c == 0) {
- 
 
 469 
	Rprintf("<0 x 0 matrix>\n");
- 
 
 470 
	return;
- 
 
 471 
    }
438 
    switch (TYPEOF(x)) {
 472 
    switch (TYPEOF(x)) {
439 
    case LGLSXP:
 473 
    case LGLSXP:
440 
	printLogicalMatrix(x, offset, r, c, rl, cl, rn, cn);
 474 
	printLogicalMatrix(x, offset, r, c, rl, cl, rn, cn);
441 
	break;
 475 
	break;
442 
    case INTSXP:
 476 
    case INTSXP: