mirrors/BSDGames
1
0
Fork 0
mirror of https://github.com/vattam/BSDGames.git synced 2025-12-20 19:04:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Initial revision

Browse Source 
git-svn-id: file:///srv/svn/joey/bsdgames-trunk@5086 a4a2c43b-8ac3-0310-8836-e0e880c912e2
This commit is contained in:
joey
1999-09-08 23:56:51 +00:00
commit 03272d67da
623 changed files with 243457 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
number/Makefile.bsd Normal file
View File

@@ -0,0 +1,7 @@
# $NetBSD: Makefile,v 1.4 1995/03/23 08:35:27 cgd Exp $
# @(#)Makefile 8.1 (Berkeley) 5/31/93
PROG= number
MAN= number.6
.include <bsd.prog.mk>

14
number/Makefrag Normal file
View File

@@ -0,0 +1,14 @@
# Makefrag - makefile fragment for number
number_DEFS := -D_GNU_SOURCE
number_DIRS := $(GAMESDIR) $(MAN6DIR)
number_all: number/number number/number.6
number_install: number_all
$(INSTALL_BINARY) number/number $(INSTALL_PREFIX)$(GAMESDIR)/number
$(HIDE_GAME) number
$(INSTALL_MANUAL) number/number.6
number_check: number_all
echo "1234567890" | number/number

62
number/number.6 Normal file
View File

@@ -0,0 +1,62 @@
.\" $NetBSD: number.6,v 1.5 1997/10/10 16:41:37 lukem Exp $
.\"
.\" Copyright (c) 1989, 1993, 1994
.\" The Regents of the University of California. All rights reserved.
.\"
.\" Redistribution and use in source and binary forms, with or without
.\" modification, are permitted provided that the following conditions
.\" are met:
.\" 1. Redistributions of source code must retain the above copyright
.\" notice, this list of conditions and the following disclaimer.
.\" 2. Redistributions in binary form must reproduce the above copyright
.\" notice, this list of conditions and the following disclaimer in the
.\" documentation and/or other materials provided with the distribution.
.\" 3. All advertising materials mentioning features or use of this software
.\" must display the following acknowledgement:
.\" This product includes software developed by the University of
.\" California, Berkeley and its contributors.
.\" 4. Neither the name of the University nor the names of its contributors
.\" may be used to endorse or promote products derived from this software
.\" without specific prior written permission.
.\"
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
.\" SUCH DAMAGE.
.\"
.\" @(#)number.6 8.2 (Berkeley) 3/31/94
.\"
.Dd March 31, 1994
.Dt NUMBER 6
.Os
.Sh NAME
.Nm number
.Nd convert Arabic numerals to English
.Sh SYNOPSIS
.Nm
.Op #
.Sh DESCRIPTION
The
.Nm
utility prints the English equivalent of the number to the standard
output, with each 10^3 magnitude displayed on a separate line.
If no argument is specified,
.Nm
reads lines from the standard input.
.Pp
The options are as follows:
.Bl -tag -width Ds
.It Fl l
Display the number on a single line.
.El
.Sh BUGS
Although
.Nm
understand fractions, it doesn't understand exponents.

303
number/number.c Normal file
View File

@@ -0,0 +1,303 @@
/* $NetBSD: number.c,v 1.6 1998/09/13 15:24:57 hubertf Exp $ */
/*
* Copyright (c) 1988, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#ifndef lint
__COPYRIGHT("@(#) Copyright (c) 1988, 1993, 1994\n\
The Regents of the University of California. All rights reserved.\n");
#endif /* not lint */
#ifndef lint
#if 0
static char sccsid[] = "@(#)number.c 8.3 (Berkeley) 5/4/95";
#else
__RCSID("$NetBSD: number.c,v 1.6 1998/09/13 15:24:57 hubertf Exp $");
#endif
#endif /* not lint */
#include <sys/types.h>
#include <ctype.h>
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define MAXNUM 65 /* Biggest number we handle. */
static char *name1[] = {
"", "one", "two", "three",
"four", "five", "six", "seven",
"eight", "nine", "ten", "eleven",
"twelve", "thirteen", "fourteen", "fifteen",
"sixteen", "seventeen", "eighteen", "nineteen",
},
*name2[] = {
"", "ten", "twenty", "thirty",
"forty", "fifty", "sixty", "seventy",
"eighty", "ninety",
},
*name3[] = {
"hundred", "thousand", "million", "billion",
"trillion", "quadrillion", "quintillion", "sextillion",
"septillion", "octillion", "nonillion", "decillion",
"undecillion", "duodecillion", "tredecillion", "quattuordecillion",
"quindecillion", "sexdecillion",
"septendecillion", "octodecillion",
"novemdecillion", "vigintillion",
};
void convert __P((char *));
int main __P((int, char *[]));
int number __P((char *, int));
void pfract __P((int));
int unit __P((int, char *));
void usage __P((void)) __attribute__((__noreturn__));
int lflag;
int
main(argc, argv)
int argc;
char *argv[];
{
int ch, first;
char line[256];
/* Revoke setgid privileges */
setregid(getgid(), getgid());
lflag = 0;
while ((ch = getopt(argc, argv, "l")) != -1)
switch (ch) {
case 'l':
lflag = 1;
break;
case '?':
default:
usage();
}
argc -= optind;
argv += optind;
if (*argv == NULL)
for (first = 1;
fgets(line, sizeof(line), stdin) != NULL; first = 0) {
if (strchr(line, '\n') == NULL)
errx(1, "line too long.");
if (!first)
(void)printf("...\n");
convert(line);
}
else
for (first = 1; *argv != NULL; first = 0, ++argv) {
if (!first)
(void)printf("...\n");
convert(*argv);
}
exit(0);
}
void
convert(line)
char *line;
{
int flen, len, rval;
char *p, *fraction;
flen = 0;
fraction = NULL;
for (p = line; *p != '\0' && *p != '\n'; ++p) {
if (isblank(*p)) {
if (p == line) {
++line;
continue;
}
goto badnum;
}
if (isdigit(*p))
continue;
switch (*p) {
case '.':
if (fraction != NULL)
goto badnum;
fraction = p + 1;
*p = '\0';
break;
case '-':
if (p == line)
break;
/* FALLTHROUGH */
default:
badnum: errx(1, "illegal number: %s", line);
break;
}
}
*p = '\0';
if ((len = strlen(line)) > MAXNUM ||
(fraction != NULL && (flen = strlen(fraction)) > MAXNUM))
errx(1, "number too large, max %d digits.", MAXNUM);
if (*line == '-') {
(void)printf("minus%s", lflag ? " " : "\n");
++line;
--len;
}
rval = len > 0 ? unit(len, line) : 0;
if (fraction != NULL && flen != 0)
for (p = fraction; *p != '\0'; ++p)
if (*p != '0') {
if (rval)
(void)printf("%sand%s",
lflag ? " " : "",
lflag ? " " : "\n");
if (unit(flen, fraction)) {
if (lflag)
(void)printf(" ");
pfract(flen);
rval = 1;
}
break;
}
if (!rval)
(void)printf("zero%s", lflag ? "" : ".\n");
if (lflag)
(void)printf("\n");
}
int
unit(len, p)
int len;
char *p;
{
int off, rval;
rval = 0;
if (len > 3) {
if (len % 3) {
off = len % 3;
len -= off;
if (number(p, off)) {
rval = 1;
(void)printf(" %s%s",
name3[len / 3], lflag ? " " : ".\n");
}
p += off;
}
for (; len > 3; p += 3) {
len -= 3;
if (number(p, 3)) {
rval = 1;
(void)printf(" %s%s",
name3[len / 3], lflag ? " " : ".\n");
}
}
}
if (number(p, len)) {
if (!lflag)
(void)printf(".\n");
rval = 1;
}
return (rval);
}
int
number(p, len)
char *p;
int len;
{
int val, rval;
rval = 0;
switch (len) {
case 3:
if (*p != '0') {
rval = 1;
(void)printf("%s hundred", name1[*p - '0']);
}
++p;
/* FALLTHROUGH */
case 2:
val = (p[1] - '0') + (p[0] - '0') * 10;
if (val) {
if (rval)
(void)printf(" ");
if (val < 20)
(void)printf("%s", name1[val]);
else {
(void)printf("%s", name2[val / 10]);
if (val % 10)
(void)printf("-%s", name1[val % 10]);
}
rval = 1;
}
break;
case 1:
if (*p != '0') {
rval = 1;
(void)printf("%s", name1[*p - '0']);
}
}
return (rval);
}
void
pfract(len)
int len;
{
static char *pref[] = { "", "ten-", "hundred-" };
switch(len) {
case 1:
(void)printf("tenths.\n");
break;
case 2:
(void)printf("hundredths.\n");
break;
default:
(void)printf("%s%sths.\n", pref[len % 3], name3[len / 3]);
break;
}
}
void
usage()
{
(void)fprintf(stderr, "usage: number [# ...]\n");
exit(1);
}