1 /* PSPP - computes sample statistics.
2 Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License as
6 published by the Free Software Foundation; either version 2 of the
7 License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful, but
10 WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
22 #include <data/case.h>
23 #include <data/casereader.h>
24 #include <data/dictionary.h>
25 #include <data/procedure.h>
26 #include <data/transformations.h>
27 #include <data/variable.h>
28 #include <language/command.h>
29 #include <language/lexer/lexer.h>
30 #include <language/lexer/variable-parser.h>
31 #include <libpspp/alloc.h>
32 #include <libpspp/compiler.h>
33 #include <libpspp/hash.h>
34 #include <libpspp/message.h>
35 #include <libpspp/message.h>
36 #include <libpspp/pool.h>
37 #include <libpspp/str.h>
40 #define _(msgid) gettext (msgid)
42 /* FIXME: Implement PRINT subcommand. */
44 /* An AUTORECODE variable's original value. */
47 double f; /* Numeric. */
48 char *c; /* Short or long string. */
51 /* Explains how to recode one value. `from' must be first element. */
54 union arc_value from; /* Original value. */
55 double to; /* Recoded value. */
58 /* Explains how to recode an AUTORECODE variable. */
61 const struct variable *src; /* Source variable. */
62 struct variable *dest; /* Target variable. */
63 struct hsh_table *items; /* Hash table of `freq's. */
66 /* AUTORECODE transformation. */
67 struct autorecode_trns
69 struct pool *pool; /* Contains AUTORECODE specs. */
70 struct arc_spec *specs; /* AUTORECODE specifications. */
71 size_t spec_cnt; /* Number of specifications. */
74 /* Descending or ascending sort order. */
81 /* AUTORECODE data. */
84 const struct variable **src_vars; /* Source variables. */
85 char **dst_names; /* Target variable names. */
86 struct variable **dst_vars; /* Target variables. */
87 struct hsh_table **src_values; /* `union arc_value's of source vars. */
88 size_t var_cnt; /* Number of variables. */
89 struct pool *src_values_pool; /* Pool used by src_values. */
90 enum direction direction; /* Sort order. */
91 int print; /* Print mapping table if nonzero. */
94 static trns_proc_func autorecode_trns_proc;
95 static trns_free_func autorecode_trns_free;
96 static hsh_compare_func compare_alpha_value, compare_numeric_value;
97 static hsh_hash_func hash_alpha_value, hash_numeric_value;
99 static void recode (struct dataset *, const struct autorecode_pgm *);
100 static void arc_free (struct autorecode_pgm *);
102 /* Performs the AUTORECODE procedure. */
104 cmd_autorecode (struct lexer *lexer, struct dataset *ds)
106 struct autorecode_pgm arc;
107 struct casereader *input;
114 arc.dst_names = NULL;
116 arc.src_values = NULL;
118 arc.src_values_pool = NULL;
119 arc.direction = ASCENDING;
123 lex_match_id (lexer, "VARIABLES");
124 lex_match (lexer, '=');
125 if (!parse_variables_const (lexer, dataset_dict (ds), &arc.src_vars,
129 if (!lex_force_match_id (lexer, "INTO"))
131 lex_match (lexer, '=');
132 if (!parse_DATA_LIST_vars (lexer, &arc.dst_names, &dst_cnt, PV_NONE))
134 if (dst_cnt != arc.var_cnt)
138 msg (SE, _("Source variable count (%u) does not match "
139 "target variable count (%u)."),
140 (unsigned) arc.var_cnt, (unsigned) dst_cnt);
142 for (i = 0; i < dst_cnt; i++)
143 free (arc.dst_names[i]);
144 free (arc.dst_names);
145 arc.dst_names = NULL;
149 while (lex_match (lexer, '/'))
150 if (lex_match_id (lexer, "DESCENDING"))
151 arc.direction = DESCENDING;
152 else if (lex_match_id (lexer, "PRINT"))
154 if (lex_token (lexer) != '.')
156 lex_error (lexer, _("expecting end of command"));
160 for (i = 0; i < arc.var_cnt; i++)
164 if (dict_lookup_var (dataset_dict (ds), arc.dst_names[i]) != NULL)
166 msg (SE, _("Target variable %s duplicates existing variable %s."),
167 arc.dst_names[i], arc.dst_names[i]);
170 for (j = 0; j < i; j++)
171 if (!strcasecmp (arc.dst_names[i], arc.dst_names[j]))
173 msg (SE, _("Duplicate variable name %s among target variables."),
179 arc.src_values_pool = pool_create ();
180 arc.dst_vars = xnmalloc (arc.var_cnt, sizeof *arc.dst_vars);
181 arc.src_values = xnmalloc (arc.var_cnt, sizeof *arc.src_values);
182 for (i = 0; i < dst_cnt; i++)
184 /* FIXME: consolodate this hsh_create */
185 if (var_is_alpha (arc.src_vars[i]))
186 arc.src_values[i] = hsh_create (10, compare_alpha_value,
187 hash_alpha_value, NULL, arc.src_vars[i]);
189 arc.src_values[i] = hsh_create (10, compare_numeric_value,
190 hash_numeric_value, NULL, NULL);
193 input = proc_open (ds);
194 for (; casereader_read (input, &c); case_destroy (&c))
195 for (i = 0; i < arc.var_cnt; i++)
197 union arc_value v, *vp, **vpp;
199 if (var_is_numeric (arc.src_vars[i]))
200 v.f = case_num (&c, arc.src_vars[i]);
202 v.c = (char *) case_str (&c, arc.src_vars[i]);
204 vpp = (union arc_value **) hsh_probe (arc.src_values[i], &v);
207 vp = pool_alloc (arc.src_values_pool, sizeof *vp);
208 if (var_is_numeric (arc.src_vars[i]))
211 vp->c = pool_clone (arc.src_values_pool,
212 v.c, var_get_width (arc.src_vars[i]));
216 ok = casereader_destroy (input);
217 ok = proc_commit (ds) && ok;
219 for (i = 0; i < arc.var_cnt; i++)
220 arc.dst_vars[i] = dict_create_var_assert (dataset_dict (ds),
221 arc.dst_names[i], 0);
225 return ok ? CMD_SUCCESS : CMD_CASCADING_FAILURE;
229 return CMD_CASCADING_FAILURE;
233 arc_free (struct autorecode_pgm *arc)
235 free (arc->src_vars);
236 if (arc->dst_names != NULL)
240 for (i = 0; i < arc->var_cnt; i++)
241 free (arc->dst_names[i]);
242 free (arc->dst_names);
244 free (arc->dst_vars);
245 if (arc->src_values != NULL)
249 for (i = 0; i < arc->var_cnt; i++)
250 hsh_destroy (arc->src_values[i]);
251 free (arc->src_values);
253 pool_destroy (arc->src_values_pool);
257 /* AUTORECODE transformation. */
260 recode (struct dataset *ds, const struct autorecode_pgm *arc)
262 struct autorecode_trns *trns;
265 trns = pool_create_container (struct autorecode_trns, pool);
266 trns->specs = pool_nalloc (trns->pool, arc->var_cnt, sizeof *trns->specs);
267 trns->spec_cnt = arc->var_cnt;
268 for (i = 0; i < arc->var_cnt; i++)
270 struct arc_spec *spec = &trns->specs[i];
271 void *const *p = hsh_sort (arc->src_values[i]);
272 int count = hsh_count (arc->src_values[i]);
275 spec->src = arc->src_vars[i];
276 spec->dest = arc->dst_vars[i];
278 if (var_is_alpha (arc->src_vars[i]))
279 spec->items = hsh_create (2 * count, compare_alpha_value,
280 hash_alpha_value, NULL, arc->src_vars[i]);
282 spec->items = hsh_create (2 * count, compare_numeric_value,
283 hash_numeric_value, NULL, NULL);
285 for (j = 0; *p; p++, j++)
287 struct arc_item *item = pool_alloc (trns->pool, sizeof *item);
288 union arc_value *vp = *p;
290 if (var_is_numeric (arc->src_vars[i]))
291 item->from.f = vp->f;
293 item->from.c = pool_clone (trns->pool, vp->c,
294 var_get_width (arc->src_vars[i]));
295 item->to = arc->direction == ASCENDING ? j + 1 : count - j;
296 hsh_force_insert (spec->items, item);
299 add_transformation (ds,
300 autorecode_trns_proc, autorecode_trns_free, trns);
303 /* Executes an AUTORECODE transformation. */
305 autorecode_trns_proc (void *trns_, struct ccase *c, casenumber case_idx UNUSED)
307 struct autorecode_trns *trns = trns_;
310 for (i = 0; i < trns->spec_cnt; i++)
312 struct arc_spec *spec = &trns->specs[i];
313 struct arc_item *item;
316 if (var_is_numeric (spec->src))
317 v.f = case_num (c, spec->src);
319 v.c = (char *) case_str (c, spec->src);
320 item = hsh_force_find (spec->items, &v);
322 case_data_rw (c, spec->dest)->f = item->to;
324 return TRNS_CONTINUE;
327 /* Frees an AUTORECODE transformation. */
329 autorecode_trns_free (void *trns_)
331 struct autorecode_trns *trns = trns_;
334 for (i = 0; i < trns->spec_cnt; i++)
335 hsh_destroy (trns->specs[i].items);
336 pool_destroy (trns->pool);
340 /* AUTORECODE procedure. */
343 compare_alpha_value (const void *a_, const void *b_, const void *v_)
345 const union arc_value *a = a_;
346 const union arc_value *b = b_;
347 const struct variable *v = v_;
349 return memcmp (a->c, b->c, var_get_width (v));
353 hash_alpha_value (const void *a_, const void *v_)
355 const union arc_value *a = a_;
356 const struct variable *v = v_;
358 return hsh_hash_bytes (a->c, var_get_width (v));
362 compare_numeric_value (const void *a_, const void *b_, const void *aux UNUSED)
364 const union arc_value *a = a_;
365 const union arc_value *b = b_;
367 return a->f < b->f ? -1 : a->f > b->f;
371 hash_numeric_value (const void *a_, const void *aux UNUSED)
373 const union arc_value *a = a_;
375 return hsh_hash_double (a->f);