jot-10.0/000075500000000000000000000000001226573247200122365ustar00rootroot00000000000000jot-10.0/Makefile000064400000000000000000000001321226573247200136720ustar00rootroot00000000000000# From: @(#)Makefile 8.1 (Berkeley) 6/6/93 # $FreeBSD$ PROG= jot .include jot-10.0/jot.1000064400000000000000000000174471226573247200131310ustar00rootroot00000000000000.\" Copyright (c) 1993 .\" 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. .\" 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. .\" .\" @(#)jot.1 8.1 (Berkeley) 6/6/93 .\" $FreeBSD$ .\" .Dd June 2, 2010 .Dt JOT 1 .Os .Sh NAME .Nm jot .Nd print sequential or random data .Sh SYNOPSIS .Nm .Op Fl cnr .Op Fl b Ar word .Op Fl w Ar word .Op Fl s Ar string .Op Fl p Ar precision .Op Ar reps Op Ar begin Op Ar end Op Ar s .Sh DESCRIPTION The .Nm utility is used to print out increasing, decreasing, random, or redundant data, usually numbers, one per line. .Pp The following options are available: .Bl -tag -width indent .It Fl r Generate random data instead of the default sequential data. .It Fl b Ar word Just print .Ar word repetitively. .It Fl w Ar word Print .Ar word with the generated data appended to it. Octal, hexadecimal, exponential, .Tn ASCII , zero padded, and right-adjusted representations are possible by using the appropriate .Xr printf 3 conversion specification inside .Ar word , in which case the data are inserted rather than appended. .It Fl c This is an abbreviation for .Fl w Ar %c . .It Fl s Ar string Print data separated by .Ar string . Normally, newlines separate data. .It Fl n Do not print the final newline normally appended to the output. .It Fl p Ar precision Print only as many digits or characters of the data as indicated by the integer .Ar precision . In the absence of .Fl p , the precision is the greater of the precisions of .Ar begin and .Ar end . The .Fl p option is overridden by whatever appears in a .Xr printf 3 conversion following .Fl w . .El .Pp The last four arguments indicate, respectively, the number of data, the lower bound, the upper bound, and the step size or, for random data, the seed. While at least one of them must appear, any of the other three may be omitted, and will be considered as such if given as .Fl "" or as an empty string. Any three of these arguments determines the fourth. If four are specified and the given and computed values of .Ar reps conflict, the lower value is used. If fewer than three are specified, defaults are assigned left to right, except for .Ar s , which assumes a default of 1 or -1 if both .Ar begin and .Ar end are given. .Pp Defaults for the four arguments are, respectively, 100, 1, 100, and 1, except that when random data are requested, the seed, .Ar s , is picked randomly. The .Ar reps argument is expected to be an unsigned integer, and if given as zero is taken to be infinite. The .Ar begin and .Ar end arguments may be given as real numbers or as characters representing the corresponding value in .Tn ASCII . The last argument must be a real number. .Pp Random numbers are obtained through .Xr arc4random 3 when no seed is specified, and through .Xr random 3 when a seed is given. When .Nm is asked to generate random integers or characters with begin and end values in the range of the random number generator function and no format is specified with one of the .Fl w , .Fl b , or .Fl p options, .Nm will arrange for all the values in the range to appear in the output with an equal probability. In all other cases be careful to ensure that the output format's rounding or truncation will not skew the distribution of output values in an unintended way. .Pp The name .Nm derives in part from .Nm iota , a function in APL. .Ss Rounding and truncation The .Nm utility uses double precision floating point arithmetic internally. Before printing a number, it is converted depending on the output format used. .Pp If no output format is specified or the output format is a floating point format .Po .Sq E , .Sq G , .Sq e , .Sq f , or .Sq g .Pc , the value is rounded using the .Xr printf 3 function, taking into account the requested precision. .Pp If the output format is an integer format .Po .Sq D , .Sq O , .Sq U , .Sq X , .Sq c , .Sq d , .Sq i , .Sq o , .Sq u , or .Sq x .Pc , the value is converted to an integer value by truncation. .Pp As an illustration, consider the following command: .Bd -literal -offset indent $ jot 6 1 10 0.5 1 2 2 2 3 4 .Ed .Pp By requesting an explicit precision of 1, the values generated before rounding can be seen. The .5 values are rounded down if the integer part is even, up otherwise. .Bd -literal -offset indent $ jot -p 1 6 1 10 0.5 1.0 1.5 2.0 2.5 3.0 3.5 .Ed .Pp By offsetting the values slightly, the values generated by the following command are always rounded down: .Bd -literal -offset indent $ jot -p 0 6 .9999999999 10 0.5 1 1 2 2 3 3 .Ed .Pp Another way of achieving the same result is to force truncation by specifying an integer format: .Bd -literal -offset indent $ jot -w %d 6 1 10 0.5 .Ed .Sh EXIT STATUS .Ex -std .Sh EXAMPLES The command .Dl jot - 1 10 .Pp prints the integers from 1 to 10, while the command .Dl jot 21 -1 1.00 .Pp prints 21 evenly spaced numbers increasing from -1 to 1. The .Tn ASCII character set is generated with .Dl jot -c 128 0 .Pp and the strings xaa through xaz with .Dl jot -w xa%c 26 a .Pp while 20 random 8-letter strings are produced with .Dl "jot -r -c 160 a z | rs -g 0 8" .Pp Infinitely many .Em yes Ns 's may be obtained through .Dl jot -b yes 0 .Pp and thirty .Xr ed 1 substitution commands applying to lines 2, 7, 12, etc.\& is the result of .Dl jot -w %ds/old/new/ 30 2 - 5 .Pp The stuttering sequence 9, 9, 8, 8, 7, etc.\& can be produced by truncating the output precision and a suitable choice of step size, as in .Dl jot -w %d - 9.5 0 -.5 .Pp and a file containing exactly 1024 bytes is created with .Dl jot -b x 512 > block .Pp Finally, to set tabs four spaces apart starting from column 10 and ending in column 132, use .Dl expand -`jot -s, - 10 132 4` .Pp and to print all lines 80 characters or longer, .Dl grep `jot -s \&"\&" -b \&. 80` .Sh DIAGNOSTICS The following diagnostic messages deserve special explanation: .Bl -diag .It "illegal or unsupported format '%s'" The requested conversion format specifier for .Xr printf 3 was not of the form .Dl %[#][ ][{+,-}][0-9]*[.[0-9]*]? where .Dq ?\& must be one of .Dl [l]{d,i,o,u,x} or .Dl {c,e,f,g,D,E,G,O,U,X} .It "range error in conversion" A value to be printed fell outside the range of the data type associated with the requested output format. .It "too many conversions" More than one conversion format specifier has been supplied, but only one is allowed. .El .Sh SEE ALSO .Xr ed 1 , .Xr expand 1 , .Xr rs 1 , .Xr seq 1 , .Xr yes 1 , .Xr arc4random 3 , .Xr printf 3 , .Xr random 3 .Sh HISTORY The .Nm utility first appeared in .Bx 4.2 . jot-10.0/jot.c000064400000000000000000000272071226573247200132060ustar00rootroot00000000000000/*- * Copyright (c) 1993 * 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. * 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. */ #ifndef lint static const char copyright[] = "@(#) Copyright (c) 1993\n\ The Regents of the University of California. All rights reserved.\n"; #endif /* not lint */ #ifndef lint #if 0 static char sccsid[] = "@(#)jot.c 8.1 (Berkeley) 6/6/93"; #endif #endif #include __FBSDID("$FreeBSD$"); /* * jot - print sequential or random data * * Author: John Kunze, Office of Comp. Affairs, UCB */ #include #include #include #include #include #include #include #include #include #include /* Defaults */ #define REPS_DEF 100 #define BEGIN_DEF 1 #define ENDER_DEF 100 #define STEP_DEF 1 /* Flags of options that have been set */ #define HAVE_STEP 1 #define HAVE_ENDER 2 #define HAVE_BEGIN 4 #define HAVE_REPS 8 #define is_default(s) (*(s) == 0 || strcmp((s), "-") == 0) static bool boring; static int prec = -1; static bool longdata; static bool intdata; static bool chardata; static bool nosign; static const char *sepstring = "\n"; static char format[BUFSIZ]; static void getformat(void); static int getprec(const char *); static int putdata(double, bool); static void usage(void); int main(int argc, char **argv) { bool have_format = false; bool infinity = false; bool nofinalnl = false; bool randomize = false; bool use_random = false; int ch; int mask = 0; int n = 0; double begin = BEGIN_DEF; double divisor; double ender = ENDER_DEF; double s = STEP_DEF; double x, y; long i; long reps = REPS_DEF; while ((ch = getopt(argc, argv, "b:cnp:rs:w:")) != -1) switch (ch) { case 'b': boring = true; /* FALLTHROUGH */ case 'w': if (strlcpy(format, optarg, sizeof(format)) >= sizeof(format)) errx(1, "-%c word too long", ch); have_format = true; break; case 'c': chardata = true; break; case 'n': nofinalnl = true; break; case 'p': prec = atoi(optarg); if (prec < 0) errx(1, "bad precision value"); have_format = true; break; case 'r': randomize = true; break; case 's': sepstring = optarg; break; default: usage(); } argc -= optind; argv += optind; switch (argc) { /* examine args right to left, falling thru cases */ case 4: if (!is_default(argv[3])) { if (!sscanf(argv[3], "%lf", &s)) errx(1, "bad s value: %s", argv[3]); mask |= HAVE_STEP; if (randomize) use_random = true; } /* FALLTHROUGH */ case 3: if (!is_default(argv[2])) { if (!sscanf(argv[2], "%lf", &ender)) ender = argv[2][strlen(argv[2])-1]; mask |= HAVE_ENDER; if (prec < 0) n = getprec(argv[2]); } /* FALLTHROUGH */ case 2: if (!is_default(argv[1])) { if (!sscanf(argv[1], "%lf", &begin)) begin = argv[1][strlen(argv[1])-1]; mask |= HAVE_BEGIN; if (prec < 0) prec = getprec(argv[1]); if (n > prec) /* maximum precision */ prec = n; } /* FALLTHROUGH */ case 1: if (!is_default(argv[0])) { if (!sscanf(argv[0], "%ld", &reps)) errx(1, "bad reps value: %s", argv[0]); mask |= HAVE_REPS; } break; case 0: usage(); default: errx(1, "too many arguments. What do you mean by %s?", argv[4]); } getformat(); if (prec == -1) prec = 0; while (mask) /* 4 bit mask has 1's where last 4 args were given */ switch (mask) { /* fill in the 0's by default or computation */ case HAVE_STEP: case HAVE_ENDER: case HAVE_ENDER | HAVE_STEP: case HAVE_BEGIN: case HAVE_BEGIN | HAVE_STEP: reps = REPS_DEF; mask |= HAVE_REPS; break; case HAVE_BEGIN | HAVE_ENDER: s = ender > begin ? 1 : -1; mask |= HAVE_STEP; break; case HAVE_BEGIN | HAVE_ENDER | HAVE_STEP: if (randomize) reps = REPS_DEF; else if (s == 0.0) reps = 0; else reps = (ender - begin + s) / s; if (reps <= 0) errx(1, "impossible stepsize"); mask = 0; break; case HAVE_REPS: case HAVE_REPS | HAVE_STEP: begin = BEGIN_DEF; mask |= HAVE_BEGIN; break; case HAVE_REPS | HAVE_ENDER: s = STEP_DEF; mask = HAVE_REPS | HAVE_ENDER | HAVE_STEP; break; case HAVE_REPS | HAVE_ENDER | HAVE_STEP: if (randomize) begin = BEGIN_DEF; else if (reps == 0) errx(1, "must specify begin if reps == 0"); begin = ender - reps * s + s; mask = 0; break; case HAVE_REPS | HAVE_BEGIN: s = STEP_DEF; mask = HAVE_REPS | HAVE_BEGIN | HAVE_STEP; break; case HAVE_REPS | HAVE_BEGIN | HAVE_STEP: if (randomize) ender = ENDER_DEF; else ender = begin + reps * s - s; mask = 0; break; case HAVE_REPS | HAVE_BEGIN | HAVE_ENDER: if (reps == 0) errx(1, "infinite sequences cannot be bounded"); else if (reps == 1) s = 0.0; else s = (ender - begin) / (reps - 1); mask = 0; break; case HAVE_REPS | HAVE_BEGIN | HAVE_ENDER | HAVE_STEP: /* if reps given and implied, */ if (!randomize && s != 0.0) { long t = (ender - begin + s) / s; if (t <= 0) errx(1, "impossible stepsize"); if (t < reps) /* take lesser */ reps = t; } mask = 0; break; default: errx(1, "bad mask"); } if (reps == 0) infinity = true; if (randomize) { if (use_random) { srandom((unsigned long)s); divisor = (double)INT32_MAX + 1; } else divisor = (double)UINT32_MAX + 1; /* * Attempt to DWIM when the user has specified an * integer range within that of the random number * generator: distribute the numbers equally in * the range [begin .. ender]. Jot's default %.0f * format would make the appearance of the first and * last specified value half as likely as the rest. */ if (!have_format && prec == 0 && begin >= 0 && begin < divisor && ender >= 0 && ender < divisor) { if (begin <= ender) ender += 1; else begin += 1; nosign = true; intdata = true; (void)strlcpy(format, chardata ? "%c" : "%u", sizeof(format)); } x = ender - begin; for (i = 1; i <= reps || infinity; i++) { if (use_random) y = random() / divisor; else y = arc4random() / divisor; if (putdata(y * x + begin, !(reps - i))) errx(1, "range error in conversion"); } } else for (i = 1, x = begin; i <= reps || infinity; i++, x += s) if (putdata(x, !(reps - i))) errx(1, "range error in conversion"); if (!nofinalnl) putchar('\n'); exit(0); } /* * Send x to stdout using the specified format. * Last is true if this is the set's last value. * Return 0 if OK, or a positive number if the number passed was * outside the range specified by the various flags. */ static int putdata(double x, bool last) { if (boring) printf("%s", format); else if (longdata && nosign) { if (x <= (double)ULONG_MAX && x >= (double)0) printf(format, (unsigned long)x); else return (1); } else if (longdata) { if (x <= (double)LONG_MAX && x >= (double)LONG_MIN) printf(format, (long)x); else return (1); } else if (chardata || (intdata && !nosign)) { if (x <= (double)INT_MAX && x >= (double)INT_MIN) printf(format, (int)x); else return (1); } else if (intdata) { if (x <= (double)UINT_MAX && x >= (double)0) printf(format, (unsigned int)x); else return (1); } else printf(format, x); if (!last) fputs(sepstring, stdout); return (0); } static void usage(void) { fprintf(stderr, "%s\n%s\n", "usage: jot [-cnr] [-b word] [-w word] [-s string] [-p precision]", " [reps [begin [end [s]]]]"); exit(1); } /* * Return the number of digits following the number's decimal point. * Return 0 if no decimal point is found. */ static int getprec(const char *str) { const char *p; const char *q; for (p = str; *p; p++) if (*p == '.') break; if (!*p) return (0); for (q = ++p; *p; p++) if (!isdigit((unsigned char)*p)) break; return (p - q); } /* * Set format, intdata, chardata, longdata, and nosign * based on the command line arguments. */ static void getformat(void) { char *p, *p2; int dot, hash, space, sign, numbers = 0; size_t sz; if (boring) /* no need to bother */ return; for (p = format; *p; p++) /* look for '%' */ if (*p == '%') { if (p[1] == '%') p++; /* leave %% alone */ else break; } sz = sizeof(format) - strlen(format) - 1; if (!*p && !chardata) { if (snprintf(p, sz, "%%.%df", prec) >= (int)sz) errx(1, "-w word too long"); } else if (!*p && chardata) { if (strlcpy(p, "%c", sz) >= sz) errx(1, "-w word too long"); intdata = true; } else if (!*(p+1)) { if (sz <= 0) errx(1, "-w word too long"); strcat(format, "%"); /* cannot end in single '%' */ } else { /* * Allow conversion format specifiers of the form * %[#][ ][{+,-}][0-9]*[.[0-9]*]? where ? must be one of * [l]{d,i,o,u,x} or {f,e,g,E,G,d,o,x,D,O,U,X,c,u} */ p2 = p++; dot = hash = space = sign = numbers = 0; while (!isalpha((unsigned char)*p)) { if (isdigit((unsigned char)*p)) { numbers++; p++; } else if ((*p == '#' && !(numbers|dot|sign|space| hash++)) || (*p == ' ' && !(numbers|dot|space++)) || ((*p == '+' || *p == '-') && !(numbers|dot|sign++)) || (*p == '.' && !(dot++))) p++; else goto fmt_broken; } if (*p == 'l') { longdata = true; if (*++p == 'l') { if (p[1] != '\0') p++; goto fmt_broken; } } switch (*p) { case 'o': case 'u': case 'x': case 'X': intdata = nosign = true; break; case 'd': case 'i': intdata = true; break; case 'D': if (!longdata) { intdata = true; break; } case 'O': case 'U': if (!longdata) { intdata = nosign = true; break; } case 'c': if (!(intdata | longdata)) { chardata = true; break; } case 'h': case 'n': case 'p': case 'q': case 's': case 'L': case '$': case '*': goto fmt_broken; case 'f': case 'e': case 'g': case 'E': case 'G': if (!longdata) break; /* FALLTHROUGH */ default: fmt_broken: *++p = '\0'; errx(1, "illegal or unsupported format '%s'", p2); /* NOTREACHED */ } while (*++p) if (*p == '%' && *(p+1) && *(p+1) != '%') errx(1, "too many conversions"); else if (*p == '%' && *(p+1) == '%') p++; else if (*p == '%' && !*(p+1)) { if (strlcat(format, "%", sizeof(format)) >= sizeof(format)) errx(1, "-w word too long"); break; } } }