76 lines
2.0 KiB
C++
76 lines
2.0 KiB
C++
/*-
|
|
* This code is derived from software copyrighted by the Free Software
|
|
* Foundation.
|
|
*
|
|
* Modified 1991 by Donn Seeley at UUNET Technologies, Inc.
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)iftoa.cc 6.3 (Berkeley) 5/8/91";
|
|
#endif /* not lint */
|
|
|
|
/* Copyright (C) 1989, 1990 Free Software Foundation, Inc.
|
|
Written by James Clark (jjc@jclark.uucp)
|
|
|
|
This file is part of groff.
|
|
|
|
groff 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 1, or (at your option) any later
|
|
version.
|
|
|
|
groff 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 groff; see the file LICENSE. If not, write to the Free Software
|
|
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
#include "lib.h"
|
|
|
|
const char *iftoa(int i, int decimal_point)
|
|
{
|
|
/* room for a -, 10 digits, a decimal point, and a terminating '\0' */
|
|
static char buf[INT_DIGITS + 3];
|
|
char *p = buf + INT_DIGITS + 2;
|
|
int point = 0;
|
|
buf[INT_DIGITS + 2] = '\0';
|
|
/* assert(decimal_point <= INT_DIGITS); */
|
|
if (i >= 0) {
|
|
do {
|
|
*--p = '0' + (i % 10);
|
|
i /= 10;
|
|
if (++point == decimal_point)
|
|
*--p = '.';
|
|
} while (i != 0 || point < decimal_point);
|
|
}
|
|
else { /* i < 0 */
|
|
do {
|
|
*--p = '0' - (i % 10);
|
|
i /= 10;
|
|
if (++point == decimal_point)
|
|
*--p = '.';
|
|
} while (i != 0 || point < decimal_point);
|
|
*--p = '-';
|
|
}
|
|
if (decimal_point > 0) {
|
|
char *q;
|
|
/* there must be a dot, so this will terminate */
|
|
for (q = buf + INT_DIGITS + 2; q[-1] == '0'; --q)
|
|
;
|
|
if (q[-1] == '.') {
|
|
if (q - 1 == p) {
|
|
q[-1] = '0';
|
|
q[0] = '\0';
|
|
}
|
|
else
|
|
q[-1] = '\0';
|
|
}
|
|
else
|
|
*q = '\0';
|
|
}
|
|
return p;
|
|
}
|