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
26 #include "dictionary.h"
33 #include "procedure.h"
36 #define _(msgid) gettext (msgid)
38 /* FIXME: Implement PRINT subcommand. */
40 /* Explains how to recode one value. `from' must be first element. */
43 union value from; /* Original value. */
44 double to; /* Recoded value. */
47 /* Explains how to recode an AUTORECODE variable. */
50 struct variable *src; /* Source variable. */
51 struct variable *dest; /* Target variable. */
52 struct hsh_table *items; /* Hash table of `freq's. */
55 /* AUTORECODE transformation. */
56 struct autorecode_trns
58 struct pool *pool; /* Contains AUTORECODE specs. */
59 struct arc_spec *specs; /* AUTORECODE specifications. */
60 size_t spec_cnt; /* Number of specifications. */
63 /* Descending or ascending sort order. */
70 /* AUTORECODE data. */
73 struct variable **src_vars; /* Source variables. */
74 char **dst_names; /* Target variable names. */
75 struct variable **dst_vars; /* Target variables. */
76 struct hsh_table **src_values; /* `union value's of source vars. */
77 size_t var_cnt; /* Number of variables. */
78 struct pool *src_values_pool; /* Pool used by src_values. */
79 enum direction direction; /* Sort order. */
80 int print; /* Print mapping table if nonzero. */
83 static trns_proc_func autorecode_trns_proc;
84 static trns_free_func autorecode_trns_free;
85 static bool autorecode_proc_func (struct ccase *, void *);
86 static hsh_compare_func compare_alpha_value, compare_numeric_value;
87 static hsh_hash_func hash_alpha_value, hash_numeric_value;
89 static void recode (const struct autorecode_pgm *);
90 static void arc_free (struct autorecode_pgm *);
92 /* Performs the AUTORECODE procedure. */
96 struct autorecode_pgm arc;
102 arc.dst_names = NULL;
104 arc.src_values = NULL;
106 arc.src_values_pool = NULL;
107 arc.direction = ASCENDING;
111 lex_match_id ("VARIABLES");
113 if (!parse_variables (default_dict, &arc.src_vars, &arc.var_cnt,
116 if (!lex_force_match_id ("INTO"))
119 if (!parse_DATA_LIST_vars (&arc.dst_names, &dst_cnt, PV_NONE))
121 if (dst_cnt != arc.var_cnt)
125 msg (SE, _("Source variable count (%u) does not match "
126 "target variable count (%u)."),
127 (unsigned) arc.var_cnt, (unsigned) dst_cnt);
129 for (i = 0; i < dst_cnt; i++)
130 free (arc.dst_names[i]);
131 free (arc.dst_names);
132 arc.dst_names = NULL;
136 while (lex_match ('/'))
137 if (lex_match_id ("DESCENDING"))
138 arc.direction = DESCENDING;
139 else if (lex_match_id ("PRINT"))
143 lex_error (_("expecting end of command"));
147 for (i = 0; i < arc.var_cnt; i++)
151 if (dict_lookup_var (default_dict, arc.dst_names[i]) != NULL)
153 msg (SE, _("Target variable %s duplicates existing variable %s."),
154 arc.dst_names[i], arc.dst_names[i]);
157 for (j = 0; j < i; j++)
158 if (!strcasecmp (arc.dst_names[i], arc.dst_names[j]))
160 msg (SE, _("Duplicate variable name %s among target variables."),
166 arc.src_values_pool = pool_create ();
167 arc.dst_vars = xnmalloc (arc.var_cnt, sizeof *arc.dst_vars);
168 arc.src_values = xnmalloc (arc.var_cnt, sizeof *arc.src_values);
169 for (i = 0; i < dst_cnt; i++)
170 if (arc.src_vars[i]->type == ALPHA)
171 arc.src_values[i] = hsh_create (10, compare_alpha_value,
172 hash_alpha_value, NULL, arc.src_vars[i]);
174 arc.src_values[i] = hsh_create (10, compare_numeric_value,
175 hash_numeric_value, NULL, NULL);
177 ok = procedure (autorecode_proc_func, &arc);
179 for (i = 0; i < arc.var_cnt; i++)
181 arc.dst_vars[i] = dict_create_var_assert (default_dict,
182 arc.dst_names[i], 0);
183 arc.dst_vars[i]->init = 0;
188 return ok ? CMD_SUCCESS : CMD_CASCADING_FAILURE;
192 return CMD_CASCADING_FAILURE;
196 arc_free (struct autorecode_pgm *arc)
198 free (arc->src_vars);
199 if (arc->dst_names != NULL)
203 for (i = 0; i < arc->var_cnt; i++)
204 free (arc->dst_names[i]);
205 free (arc->dst_names);
207 free (arc->dst_vars);
208 if (arc->src_values != NULL)
212 for (i = 0; i < arc->var_cnt; i++)
213 hsh_destroy (arc->src_values[i]);
214 free (arc->src_values);
216 pool_destroy (arc->src_values_pool);
220 /* AUTORECODE transformation. */
223 recode (const struct autorecode_pgm *arc)
225 struct autorecode_trns *trns;
228 trns = pool_create_container (struct autorecode_trns, pool);
229 trns->specs = pool_nalloc (trns->pool, arc->var_cnt, sizeof *trns->specs);
230 trns->spec_cnt = arc->var_cnt;
231 for (i = 0; i < arc->var_cnt; i++)
233 struct arc_spec *spec = &trns->specs[i];
234 void *const *p = hsh_sort (arc->src_values[i]);
235 int count = hsh_count (arc->src_values[i]);
238 spec->src = arc->src_vars[i];
239 spec->dest = arc->dst_vars[i];
241 if (arc->src_vars[i]->type == ALPHA)
242 spec->items = hsh_create (2 * count, compare_alpha_value,
243 hash_alpha_value, NULL, arc->src_vars[i]);
245 spec->items = hsh_create (2 * count, compare_numeric_value,
246 hash_numeric_value, NULL, NULL);
248 for (j = 0; *p; p++, j++)
250 struct arc_item *item = pool_alloc (trns->pool, sizeof *item);
251 union value *vp = *p;
253 if (arc->src_vars[i]->type == NUMERIC)
254 item->from.f = vp->f;
256 item->from.c = pool_clone (trns->pool, vp->c,
257 arc->src_vars[i]->width);
258 item->to = arc->direction == ASCENDING ? j + 1 : count - j;
259 hsh_force_insert (spec->items, item);
262 add_transformation (autorecode_trns_proc, autorecode_trns_free, trns);
265 /* Executes an AUTORECODE transformation. */
267 autorecode_trns_proc (void *trns_, struct ccase *c, int case_idx UNUSED)
269 struct autorecode_trns *trns = trns_;
272 for (i = 0; i < trns->spec_cnt; i++)
274 struct arc_spec *spec = &trns->specs[i];
275 struct arc_item *item;
278 if (spec->src->type == NUMERIC)
279 v.f = case_num (c, spec->src->fv);
281 v.c = (char *) case_str (c, spec->src->fv);
282 item = hsh_force_find (spec->items, &v);
284 case_data_rw (c, spec->dest->fv)->f = item->to;
286 return TRNS_CONTINUE;
289 /* Frees an AUTORECODE transformation. */
291 autorecode_trns_free (void *trns_)
293 struct autorecode_trns *trns = trns_;
296 for (i = 0; i < trns->spec_cnt; i++)
297 hsh_destroy (trns->specs[i].items);
298 pool_destroy (trns->pool);
302 /* AUTORECODE procedure. */
305 compare_alpha_value (const void *a_, const void *b_, void *v_)
307 const union value *a = a_;
308 const union value *b = b_;
309 const struct variable *v = v_;
311 return memcmp (a->c, b->c, v->width);
315 hash_alpha_value (const void *a_, void *v_)
317 const union value *a = a_;
318 const struct variable *v = v_;
320 return hsh_hash_bytes (a->c, v->width);
324 compare_numeric_value (const void *a_, const void *b_, void *foo UNUSED)
326 const union value *a = a_;
327 const union value *b = b_;
329 return a->f < b->f ? -1 : a->f > b->f;
333 hash_numeric_value (const void *a_, void *foo UNUSED)
335 const union value *a = a_;
337 return hsh_hash_double (a->f);
341 autorecode_proc_func (struct ccase *c, void *arc_)
343 struct autorecode_pgm *arc = arc_;
346 for (i = 0; i < arc->var_cnt; i++)
348 union value v, *vp, **vpp;
350 if (arc->src_vars[i]->type == NUMERIC)
351 v.f = case_num (c, arc->src_vars[i]->fv);
353 v.c = (char *) case_str (c, arc->src_vars[i]->fv);
355 vpp = (union value **) hsh_probe (arc->src_values[i], &v);
358 vp = pool_alloc (arc->src_values_pool, sizeof *vp);
359 if (arc->src_vars[i]->type == NUMERIC)
362 vp->c = pool_clone (arc->src_values_pool,
363 v.c, arc->src_vars[i]->width);