1 /* PSPP - computes sample statistics.
2 Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
3 Written by Ben Pfaff <blp@gnu.org>.
5 This program is free software; you can redistribute it and/or
6 modify it under the terms of the GNU General Public License as
7 published by the Free Software Foundation; either version 2 of the
8 License, or (at your option) any later version.
10 This program is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
32 #define _(msgid) gettext (msgid)
34 #include "debug-print.h"
36 static bool parse_number (double *, const struct fmt_spec *);
39 cmd_missing_values (void)
44 int retval = CMD_PART_SUCCESS_MAYBE;
45 bool deferred_errors = false;
51 if (!parse_variables (default_dict, &v, &nv, PV_NONE))
56 lex_error (_("expecting `('"));
60 for (i = 0; i < nv; i++)
61 mv_init (&v[i]->miss, v[i]->width);
65 struct missing_values mv;
67 for (i = 0; i < nv; i++)
68 if (v[i]->type != v[0]->type)
70 const struct variable *n = v[0]->type == NUMERIC ? v[0] : v[i];
71 const struct variable *s = v[0]->type == NUMERIC ? v[i] : v[0];
72 msg (SE, _("Cannot mix numeric variables (e.g. %s) and "
73 "string variables (e.g. %s) within a single list."),
78 if (v[0]->type == NUMERIC)
81 while (!lex_match (')'))
85 if (lex_match_id ("LO") || lex_match_id ("LOWEST"))
87 else if (!parse_number (&x, &v[0]->print))
90 if (lex_match_id ("THRU"))
94 if (lex_match_id ("HI") || lex_match_id ("HIGHEST"))
96 else if (!parse_number (&y, &v[0]->print))
99 if (x == LOWEST && y == HIGHEST)
101 msg (SE, _("LO THRU HI is an invalid range."));
102 deferred_errors = true;
104 else if (!mv_add_num_range (&mv, x, y))
105 deferred_errors = true;
111 msg (SE, _("LO or LOWEST must be part of a range."));
112 deferred_errors = true;
114 else if (!mv_add_num (&mv, x))
115 deferred_errors = true;
123 mv_init (&mv, MAX_SHORT_STRING);
124 while (!lex_match (')'))
126 if (!lex_force_string ())
128 deferred_errors = true;
132 if (ds_length (&tokstr) > MAX_SHORT_STRING)
134 ds_truncate (&tokstr, MAX_SHORT_STRING);
135 msg (SE, _("Truncating missing value to short string "
136 "length (%d characters)."),
140 ds_rpad (&tokstr, MAX_SHORT_STRING, ' ');
142 if (!mv_add_str (&mv, ds_data (&tokstr)))
143 deferred_errors = true;
150 for (i = 0; i < nv; i++)
152 if (!mv_is_resizable (&mv, v[i]->width))
154 msg (SE, _("Missing values provided are too long to assign "
155 "to variable of width %d."),
157 deferred_errors = true;
161 mv_copy (&v[i]->miss, &mv);
162 mv_resize (&v[i]->miss, v[i]->width);
171 retval = lex_end_of_command ();
176 retval = CMD_PART_SUCCESS_MAYBE;
181 parse_number (double *x, const struct fmt_spec *f)
183 if (lex_is_number ())
189 else if (token == T_STRING)
193 di.s = ds_data (&tokstr);
194 di.e = ds_end (&tokstr);
198 di.f2 = ds_length (&tokstr);
207 lex_error (_("expecting number or data string"));