summaryrefslogtreecommitdiff
path: root/coreutils/seq.c
blob: 8006be83dc5227481906dd08ce75ac4ef9bab194 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/* vi: set sw=4 ts=4: */
/*
 * seq implementation for busybox
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of version 2 of the GNU General Public License as
 *  published by the Free Software Foundation.
 *
 *  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 Library 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.
 */

#include <stdio.h>
#include <stdlib.h>
#include "busybox.h"

extern int seq_main(int argc, char **argv)
{
	double last;
	double first = 1;
	double increment = 1;
	double i;

	if (argc == 4) {
		first = atof(argv[1]);
		increment = atof(argv[2]);
	} else if (argc == 3) {
		first = atof(argv[1]);
	} else if (argc != 2) {
		bb_show_usage();
	}
	last = atof(argv[argc - 1]);

	/* You should note that this is pos-5.0.91 semantics, -- FK. */
	if ((first > last) && (increment > 0)) {
		return EXIT_SUCCESS;
	}

	for (i = first; ((first <= last) ? (i <= last) : (i >= last));
	     i += increment) {
		printf("%g\n", i);
	}

	return EXIT_SUCCESS;
}