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
21 #include "dictionary.h"
24 #include "algorithm.h"
32 #include "value-labels.h"
36 #define _(msgid) gettext (msgid)
41 struct variable **var; /* Variables. */
42 size_t var_cnt, var_cap; /* Number of variables, capacity. */
43 struct hsh_table *name_tab; /* Variable index by name. */
44 int next_value_idx; /* Index of next `union value' to allocate. */
45 struct variable **split; /* SPLIT FILE vars. */
46 size_t split_cnt; /* SPLIT FILE count. */
47 struct variable *weight; /* WEIGHT variable. */
48 struct variable *filter; /* FILTER variable. */
49 int case_limit; /* Current case limit (N command). */
50 char *label; /* File label. */
51 char *documents; /* Documents, as a string. */
52 struct vector **vector; /* Vectors of variables. */
53 size_t vector_cnt; /* Number of vectors. */
56 /* Creates and returns a new dictionary. */
60 struct dictionary *d = xmalloc (sizeof *d);
63 d->var_cnt = d->var_cap = 0;
64 d->name_tab = hsh_create (8, compare_var_names, hash_var_name, NULL, NULL);
65 d->next_value_idx = 0;
79 /* Creates and returns a (deep) copy of an existing
82 dict_clone (const struct dictionary *s)
91 for (i = 0; i < s->var_cnt; i++)
93 struct variable *sv = s->var[i];
94 struct variable *dv = dict_clone_var_assert (d, sv, sv->name);
95 var_set_short_name (dv, sv->short_name);
98 d->next_value_idx = s->next_value_idx;
100 d->split_cnt = s->split_cnt;
101 if (d->split_cnt > 0)
103 d->split = xmalloc (d->split_cnt * sizeof *d->split);
104 for (i = 0; i < d->split_cnt; i++)
105 d->split[i] = dict_lookup_var_assert (d, s->split[i]->name);
108 if (s->weight != NULL)
109 d->weight = dict_lookup_var_assert (d, s->weight->name);
111 if (s->filter != NULL)
112 d->filter = dict_lookup_var_assert (d, s->filter->name);
114 d->case_limit = s->case_limit;
115 dict_set_label (d, dict_get_label (s));
116 dict_set_documents (d, dict_get_documents (s));
118 d->vector_cnt = s->vector_cnt;
119 d->vector = xmalloc (d->vector_cnt * sizeof *d->vector);
120 for (i = 0; i < s->vector_cnt; i++)
122 struct vector *sv = s->vector[i];
123 struct vector *dv = d->vector[i] = xmalloc (sizeof *dv);
127 strcpy (dv->name, sv->name);
129 dv->var = xmalloc (dv->cnt * sizeof *dv->var);
130 for (j = 0; j < dv->cnt; j++)
131 dv->var[j] = d->var[sv->var[j]->index];
137 /* Clears the contents from a dictionary without destroying the
138 dictionary itself. */
140 dict_clear (struct dictionary *d)
142 /* FIXME? Should we really clear case_limit, label, documents?
143 Others are necessarily cleared by deleting all the variables.*/
148 for (i = 0; i < d->var_cnt; i++)
150 struct variable *v = d->var[i];
152 val_labs_destroy (v->val_labs);
158 d->var_cnt = d->var_cap = 0;
159 hsh_clear (d->name_tab);
160 d->next_value_idx = 0;
171 dict_clear_vectors (d);
174 /* Destroys the aux data for every variable in D, by calling
175 var_clear_aux() for each variable. */
177 dict_clear_aux (struct dictionary *d)
183 for (i = 0; i < d->var_cnt; i++)
184 var_clear_aux (d->var[i]);
187 /* Clears a dictionary and destroys it. */
189 dict_destroy (struct dictionary *d)
194 hsh_destroy (d->name_tab);
199 /* Returns the number of variables in D. */
201 dict_get_var_cnt (const struct dictionary *d)
208 /* Returns the variable in D with index IDX, which must be
209 between 0 and the count returned by dict_get_var_cnt(),
212 dict_get_var (const struct dictionary *d, size_t idx)
215 assert (idx < d->var_cnt);
220 /* Sets *VARS to an array of pointers to variables in D and *CNT
221 to the number of variables in *D. By default all variables
222 are returned, but bits may be set in EXCLUDE_CLASSES to
223 exclude ordinary, system, and/or scratch variables. */
225 dict_get_vars (const struct dictionary *d, struct variable ***vars,
226 size_t *cnt, unsigned exclude_classes)
232 assert (vars != NULL);
233 assert (cnt != NULL);
234 assert ((exclude_classes & ~((1u << DC_ORDINARY)
236 | (1u << DC_SCRATCH))) == 0);
239 for (i = 0; i < d->var_cnt; i++)
240 if (!(exclude_classes & (1u << dict_class_from_id (d->var[i]->name))))
243 *vars = xmalloc (count * sizeof **vars);
245 for (i = 0; i < d->var_cnt; i++)
246 if (!(exclude_classes & (1u << dict_class_from_id (d->var[i]->name))))
247 (*vars)[(*cnt)++] = d->var[i];
248 assert (*cnt == count);
252 /* Creates and returns a new variable in D with the given NAME
253 and WIDTH. Returns a null pointer if the given NAME would
254 duplicate that of an existing variable in the dictionary. */
256 dict_create_var (struct dictionary *d, const char *name, int width)
261 assert (name != NULL);
263 assert (strlen (name) >= 1);
264 assert (strlen (name) <= LONG_NAME_LEN);
266 assert (width >= 0 && width < 256);
268 /* Make sure there's not already a variable by that name. */
269 if (dict_lookup_var (d, name) != NULL)
272 /* Allocate and initialize variable. */
273 v = xmalloc (sizeof *v);
274 str_copy_trunc (v->name, sizeof v->name, name);
275 v->type = width == 0 ? NUMERIC : ALPHA;
277 v->fv = d->next_value_idx;
278 v->nv = width == 0 ? 1 : DIV_RND_UP (width, 8);
280 v->reinit = dict_class_from_id (v->name) != DC_SCRATCH;
281 v->index = d->var_cnt;
282 mv_init (&v->miss, width);
283 if (v->type == NUMERIC)
286 v->alignment = ALIGN_RIGHT;
287 v->display_width = 8;
288 v->measure = MEASURE_SCALE;
292 v->print = make_output_format (FMT_A, v->width, 0);
293 v->alignment = ALIGN_LEFT;
294 v->display_width = 8;
295 v->measure = MEASURE_NOMINAL;
298 v->val_labs = val_labs_create (v->width);
300 var_clear_short_name (v);
304 /* Update dictionary. */
305 if (d->var_cnt >= d->var_cap)
307 d->var_cap = 8 + 2 * d->var_cap;
308 d->var = xrealloc (d->var, d->var_cap * sizeof *d->var);
310 d->var[v->index] = v;
312 hsh_force_insert (d->name_tab, v);
314 d->next_value_idx += v->nv;
319 /* Creates and returns a new variable in D with the given NAME
320 and WIDTH. Assert-fails if the given NAME would duplicate
321 that of an existing variable in the dictionary. */
323 dict_create_var_assert (struct dictionary *d, const char *name, int width)
325 struct variable *v = dict_create_var (d, name, width);
330 /* Creates and returns a new variable in D with name NAME, as a
331 copy of existing variable OV, which need not be in D or in any
332 dictionary. Returns a null pointer if the given NAME would
333 duplicate that of an existing variable in the dictionary. */
335 dict_clone_var (struct dictionary *d, const struct variable *ov,
342 assert (name != NULL);
344 assert (strlen (name) >= 1);
345 assert (strlen (name) <= LONG_NAME_LEN);
347 nv = dict_create_var (d, name, ov->width);
351 /* Copy most members not copied via dict_create_var().
352 short_name[] is intentionally not copied, because there is
353 no reason to give a new variable with potentially a new name
354 the same short name. */
356 nv->reinit = ov->reinit;
357 mv_copy (&nv->miss, &ov->miss);
358 nv->print = ov->print;
359 nv->write = ov->write;
360 val_labs_destroy (nv->val_labs);
361 nv->val_labs = val_labs_copy (ov->val_labs);
362 if (ov->label != NULL)
363 nv->label = xstrdup (ov->label);
364 nv->measure = ov->measure;
365 nv->display_width = ov->display_width;
366 nv->alignment = ov->alignment;
371 /* Creates and returns a new variable in D with name NAME, as a
372 copy of existing variable OV, which need not be in D or in any
373 dictionary. Assert-fails if the given NAME would duplicate
374 that of an existing variable in the dictionary. */
376 dict_clone_var_assert (struct dictionary *d, const struct variable *ov,
379 struct variable *v = dict_clone_var (d, ov, name);
384 /* Returns the variable named NAME in D, or a null pointer if no
385 variable has that name. */
387 dict_lookup_var (const struct dictionary *d, const char *name)
392 assert (name != NULL);
394 str_copy_trunc (v.name, sizeof v.name, name);
395 return hsh_find (d->name_tab, &v);
398 /* Returns the variable named NAME in D. Assert-fails if no
399 variable has that name. */
401 dict_lookup_var_assert (const struct dictionary *d, const char *name)
403 struct variable *v = dict_lookup_var (d, name);
408 /* Returns nonzero if variable V is in dictionary D. */
410 dict_contains_var (const struct dictionary *d, const struct variable *v)
415 return v->index >= 0 && v->index < d->var_cnt && d->var[v->index] == v;
418 /* Compares two double pointers to variables, which should point
419 to elements of a struct dictionary's `var' member array. */
421 compare_var_ptrs (const void *a_, const void *b_, void *aux UNUSED)
423 struct variable *const *a = a_;
424 struct variable *const *b = b_;
426 return *a < *b ? -1 : *a > *b;
429 /* Deletes variable V from dictionary D and frees V.
431 This is a very bad idea if there might be any pointers to V
432 from outside D. In general, no variable in default_dict
433 should be deleted when any transformations are active, because
434 those transformations might reference the deleted variable.
435 The safest time to delete a variable is just after a procedure
436 has been executed, as done by MODIFY VARS.
438 Pointers to V within D are not a problem, because
439 dict_delete_var() knows to remove V from split variables,
440 weights, filters, etc. */
442 dict_delete_var (struct dictionary *d, struct variable *v)
448 assert (dict_contains_var (d, v));
450 /* Delete aux data. */
453 /* Remove V from splits, weight, filter variables. */
454 d->split_cnt = remove_equal (d->split, d->split_cnt, sizeof *d->split,
455 &v, compare_var_ptrs, NULL);
460 dict_clear_vectors (d);
462 /* Remove V from var array. */
463 remove_element (d->var, d->var_cnt, sizeof *d->var, v->index);
467 for (i = v->index; i < d->var_cnt; i++)
468 d->var[i]->index = i;
470 /* Update name hash. */
471 hsh_force_delete (d->name_tab, v);
474 val_labs_destroy (v->val_labs);
479 /* Deletes the COUNT variables listed in VARS from D. This is
480 unsafe; see the comment on dict_delete_var() for details. */
482 dict_delete_vars (struct dictionary *d,
483 struct variable *const *vars, size_t count)
485 /* FIXME: this can be done in O(count) time, but this algorithm
488 assert (count == 0 || vars != NULL);
491 dict_delete_var (d, *vars++);
494 /* Moves V to 0-based position IDX in D. Other variables in D,
495 if any, retain their relative positions. Runs in time linear
496 in the distance moved. */
498 dict_reorder_var (struct dictionary *d, struct variable *v,
501 size_t min_idx, max_idx;
506 assert (dict_contains_var (d, v));
507 assert (new_index < d->var_cnt);
509 move_element (d->var, d->var_cnt, sizeof *d->var, v->index, new_index);
511 min_idx = min (v->index, new_index);
512 max_idx = max (v->index, new_index);
513 for (i = min_idx; i <= max_idx; i++)
514 d->var[i]->index = i;
517 /* Reorders the variables in D, placing the COUNT variables
518 listed in ORDER in that order at the beginning of D. The
519 other variables in D, if any, retain their relative
522 dict_reorder_vars (struct dictionary *d,
523 struct variable *const *order, size_t count)
525 struct variable **new_var;
529 assert (count == 0 || order != NULL);
530 assert (count <= d->var_cnt);
532 new_var = xmalloc (d->var_cnt * sizeof *new_var);
533 memcpy (new_var, order, count * sizeof *new_var);
534 for (i = 0; i < count; i++)
536 assert (d->var[order[i]->index] != NULL);
537 d->var[order[i]->index] = NULL;
540 for (i = 0; i < d->var_cnt; i++)
541 if (d->var[i] != NULL)
543 assert (count < d->var_cnt);
544 new_var[count] = d->var[i];
545 new_var[count]->index = count;
552 /* Changes the name of V in D to name NEW_NAME. Assert-fails if
553 a variable named NEW_NAME is already in D, except that
554 NEW_NAME may be the same as V's existing name. */
556 dict_rename_var (struct dictionary *d, struct variable *v,
557 const char *new_name)
561 assert (new_name != NULL);
562 assert (var_is_valid_name (new_name, false));
563 assert (dict_contains_var (d, v));
564 assert (!compare_var_names (v->name, new_name, NULL)
565 || dict_lookup_var (d, new_name) == NULL);
567 hsh_force_delete (d->name_tab, v);
568 str_copy_trunc (v->name, sizeof v->name, new_name);
569 hsh_force_insert (d->name_tab, v);
571 if (get_algorithm () == ENHANCED)
572 var_clear_short_name (v);
575 /* Renames COUNT variables specified in VARS to the names given
576 in NEW_NAMES within dictionary D. If the renaming would
577 result in a duplicate variable name, returns zero and stores a
578 name that would be duplicated into *ERR_NAME (if ERR_NAME is
579 non-null). Otherwise, the renaming is successful, and nonzero
582 dict_rename_vars (struct dictionary *d,
583 struct variable **vars, char **new_names,
584 size_t count, char **err_name)
591 assert (count == 0 || vars != NULL);
592 assert (count == 0 || new_names != NULL);
594 /* Remove the variables to be renamed from the name hash,
595 save their names, and rename them. */
596 old_names = xmalloc (count * sizeof *old_names);
597 for (i = 0; i < count; i++)
599 assert (d->var[vars[i]->index] == vars[i]);
600 assert (var_is_valid_name (new_names[i], false));
601 hsh_force_delete (d->name_tab, vars[i]);
602 old_names[i] = xstrdup (vars[i]->name);
603 strcpy (vars[i]->name, new_names[i]);
606 /* Add the renamed variables back into the name hash,
607 checking for conflicts. */
608 for (i = 0; i < count; i++)
610 assert (new_names[i] != NULL);
611 assert (*new_names[i] != '\0');
612 assert (strlen (new_names[i]) >= 1);
613 assert (strlen (new_names[i]) <= LONG_NAME_LEN);
615 if (hsh_insert (d->name_tab, vars[i]) != NULL)
617 /* There is a name conflict.
618 Back out all the name changes that have already
619 taken place, and indicate failure. */
621 if (err_name != NULL)
622 *err_name = new_names[i];
624 for (i = 0; i < fail_idx; i++)
625 hsh_force_delete (d->name_tab, vars[i]);
627 for (i = 0; i < count; i++)
629 strcpy (vars[i]->name, old_names[i]);
630 hsh_force_insert (d->name_tab, vars[i]);
638 /* Clear short names. */
639 if (get_algorithm () == ENHANCED)
640 for (i = 0; i < count; i++)
641 var_clear_short_name (vars[i]);
644 /* Free the old names we kept around. */
645 for (i = 0; i < count; i++)
652 /* Returns the weighting variable in dictionary D, or a null
653 pointer if the dictionary is unweighted. */
655 dict_get_weight (const struct dictionary *d)
658 assert (d->weight == NULL || dict_contains_var (d, d->weight));
663 /* Returns the value of D's weighting variable in case C, except that a
664 negative weight is returned as 0. Returns 1 if the dictionary is
665 unweighted. Will warn about missing, negative, or zero values if
666 warn_on_invalid is nonzero. The function will set warn_on_invalid to zero
667 if an invalid weight is found. */
669 dict_get_case_weight (const struct dictionary *d, const struct ccase *c,
670 int *warn_on_invalid)
675 if (d->weight == NULL)
679 double w = case_num (c, d->weight->fv);
680 if (w < 0.0 || mv_is_num_missing (&d->weight->miss, w))
682 if ( w == 0.0 && *warn_on_invalid ) {
683 *warn_on_invalid = 0;
684 msg (SW, _("At least one case in the data file had a weight value "
685 "that was user-missing, system-missing, zero, or "
686 "negative. These case(s) were ignored."));
692 /* Sets the weighting variable of D to V, or turning off
693 weighting if V is a null pointer. */
695 dict_set_weight (struct dictionary *d, struct variable *v)
698 assert (v == NULL || dict_contains_var (d, v));
699 assert (v == NULL || v->type == NUMERIC);
704 /* Returns the filter variable in dictionary D (see cmd_filter())
705 or a null pointer if the dictionary is unfiltered. */
707 dict_get_filter (const struct dictionary *d)
710 assert (d->filter == NULL || dict_contains_var (d, d->filter));
715 /* Sets V as the filter variable for dictionary D. Passing a
716 null pointer for V turn off filtering. */
718 dict_set_filter (struct dictionary *d, struct variable *v)
721 assert (v == NULL || dict_contains_var (d, v));
726 /* Returns the case limit for dictionary D, or zero if the number
727 of cases is unlimited (see cmd_n()). */
729 dict_get_case_limit (const struct dictionary *d)
733 return d->case_limit;
736 /* Sets CASE_LIMIT as the case limit for dictionary D. Zero for
737 CASE_LIMIT indicates no limit. */
739 dict_set_case_limit (struct dictionary *d, int case_limit)
742 assert (case_limit >= 0);
744 d->case_limit = case_limit;
747 /* Returns the index of the next value to be added to D. This
748 value is the number of `union value's that need to be
749 allocated to store a case for dictionary D. */
751 dict_get_next_value_idx (const struct dictionary *d)
755 return d->next_value_idx;
758 /* Returns the number of bytes needed to store a case for
761 dict_get_case_size (const struct dictionary *d)
765 return sizeof (union value) * dict_get_next_value_idx (d);
768 /* Deletes scratch variables in dictionary D and reassigns values
769 so that fragmentation is eliminated. */
771 dict_compact_values (struct dictionary *d)
775 d->next_value_idx = 0;
776 for (i = 0; i < d->var_cnt; )
778 struct variable *v = d->var[i];
780 if (dict_class_from_id (v->name) != DC_SCRATCH)
782 v->fv = d->next_value_idx;
783 d->next_value_idx += v->nv;
787 dict_delete_var (d, v);
791 /* Copies values from SRC, which represents a case arranged
792 according to dictionary D, to DST, which represents a case
793 arranged according to the dictionary that will be produced by
794 dict_compact_values(D). */
796 dict_compact_case (const struct dictionary *d,
797 struct ccase *dst, const struct ccase *src)
803 for (i = 0; i < d->var_cnt; i++)
805 struct variable *v = d->var[i];
807 if (dict_class_from_id (v->name) != DC_SCRATCH)
809 case_copy (dst, value_idx, src, v->fv, v->nv);
815 /* Returns the number of values that would be used by a case if
816 dict_compact_values() were called. */
818 dict_get_compacted_value_cnt (const struct dictionary *d)
824 for (i = 0; i < d->var_cnt; i++)
825 if (dict_class_from_id (d->var[i]->name) != DC_SCRATCH)
826 cnt += d->var[i]->nv;
830 /* Creates and returns an array mapping from a dictionary index
831 to the `fv' that the corresponding variable will have after
832 calling dict_compact_values(). Scratch variables receive -1
833 for `fv' because dict_compact_values() will delete them. */
835 dict_get_compacted_idx_to_fv (const struct dictionary *d)
838 size_t next_value_idx;
841 idx_to_fv = xmalloc (d->var_cnt * sizeof *idx_to_fv);
843 for (i = 0; i < d->var_cnt; i++)
845 struct variable *v = d->var[i];
847 if (dict_class_from_id (v->name) != DC_SCRATCH)
849 idx_to_fv[i] = next_value_idx;
850 next_value_idx += v->nv;
858 /* Returns the SPLIT FILE vars (see cmd_split_file()). Call
859 dict_get_split_cnt() to determine how many SPLIT FILE vars
860 there are. Returns a null pointer if and only if there are no
862 struct variable *const *
863 dict_get_split_vars (const struct dictionary *d)
870 /* Returns the number of SPLIT FILE vars. */
872 dict_get_split_cnt (const struct dictionary *d)
879 /* Sets CNT split vars SPLIT in dictionary D. */
881 dict_set_split_vars (struct dictionary *d,
882 struct variable *const *split, size_t cnt)
885 assert (cnt == 0 || split != NULL);
888 d->split = xrealloc (d->split, cnt * sizeof *d->split);
889 memcpy (d->split, split, cnt * sizeof *d->split);
892 /* Returns the file label for D, or a null pointer if D is
893 unlabeled (see cmd_file_label()). */
895 dict_get_label (const struct dictionary *d)
902 /* Sets D's file label to LABEL, truncating it to a maximum of 60
905 dict_set_label (struct dictionary *d, const char *label)
912 else if (strlen (label) < 60)
913 d->label = xstrdup (label);
916 d->label = xmalloc (61);
917 memcpy (d->label, label, 60);
922 /* Returns the documents for D, or a null pointer if D has no
923 documents (see cmd_document()).. */
925 dict_get_documents (const struct dictionary *d)
932 /* Sets the documents for D to DOCUMENTS, or removes D's
933 documents if DOCUMENT is a null pointer. */
935 dict_set_documents (struct dictionary *d, const char *documents)
940 if (documents == NULL)
943 d->documents = xstrdup (documents);
946 /* Creates in D a vector named NAME that contains CNT variables
947 VAR (see cmd_vector()). Returns nonzero if successful, or
948 zero if a vector named NAME already exists in D. */
950 dict_create_vector (struct dictionary *d,
952 struct variable **var, size_t cnt)
954 struct vector *vector;
958 assert (name != NULL);
959 assert (var_is_valid_name (name, false));
960 assert (var != NULL);
963 if (dict_lookup_vector (d, name) != NULL)
966 d->vector = xrealloc (d->vector, (d->vector_cnt + 1) * sizeof *d->vector);
967 vector = d->vector[d->vector_cnt] = xmalloc (sizeof *vector);
968 vector->idx = d->vector_cnt++;
969 str_copy_trunc (vector->name, sizeof vector->name, name);
970 vector->var = xmalloc (cnt * sizeof *var);
971 for (i = 0; i < cnt; i++)
973 assert (dict_contains_var (d, var[i]));
974 vector->var[i] = var[i];
981 /* Returns the vector in D with index IDX, which must be less
982 than dict_get_vector_cnt (D). */
983 const struct vector *
984 dict_get_vector (const struct dictionary *d, size_t idx)
987 assert (idx < d->vector_cnt);
989 return d->vector[idx];
992 /* Returns the number of vectors in D. */
994 dict_get_vector_cnt (const struct dictionary *d)
998 return d->vector_cnt;
1001 /* Looks up and returns the vector within D with the given
1003 const struct vector *
1004 dict_lookup_vector (const struct dictionary *d, const char *name)
1009 assert (name != NULL);
1011 for (i = 0; i < d->vector_cnt; i++)
1012 if (!strcasecmp (d->vector[i]->name, name))
1013 return d->vector[i];
1017 /* Deletes all vectors from D. */
1019 dict_clear_vectors (struct dictionary *d)
1025 for (i = 0; i < d->vector_cnt; i++)
1027 free (d->vector[i]->var);
1028 free (d->vector[i]);
1035 /* Compares two strings. */
1037 compare_strings (const void *a, const void *b, void *aux UNUSED)
1039 return strcmp (a, b);
1042 /* Hashes a string. */
1044 hash_string (const void *s, void *aux UNUSED)
1046 return hsh_hash_string (s);
1049 /* Assigns a valid, unique short_name[] to each variable in D.
1050 Each variable whose actual name is short has highest priority
1051 for that short name. Otherwise, variables with an existing
1052 short_name[] have the next highest priority for a given short
1053 name; if it is already taken, then the variable is treated as
1054 if short_name[] had been empty. Otherwise, long names are
1055 truncated to form short names. If that causes conflicts,
1056 variables are renamed as PREFIX_A, PREFIX_B, and so on. */
1058 dict_assign_short_names (struct dictionary *d)
1060 struct hsh_table *short_names;
1063 /* Give variables whose names are short the corresponding short
1064 names, and clear short_names[] that conflict with a variable
1066 for (i = 0; i < d->var_cnt; i++)
1068 struct variable *v = d->var[i];
1069 if (strlen (v->name) <= SHORT_NAME_LEN)
1070 var_set_short_name (v, v->name);
1071 else if (dict_lookup_var (d, v->short_name) != NULL)
1072 var_clear_short_name (v);
1075 /* Each variable with an assigned short_name[] now gets it
1076 unless there is a conflict. */
1077 short_names = hsh_create (d->var_cnt, compare_strings, hash_string,
1079 for (i = 0; i < d->var_cnt; i++)
1081 struct variable *v = d->var[i];
1082 if (v->short_name[0] && hsh_insert (short_names, v->short_name) != NULL)
1083 var_clear_short_name (v);
1086 /* Now assign short names to remaining variables. */
1087 for (i = 0; i < d->var_cnt; i++)
1089 struct variable *v = d->var[i];
1090 if (v->short_name[0] == '\0')
1094 /* Form initial short_name. */
1095 var_set_short_name (v, v->name);
1097 /* Try _A, _B, ... _AA, _AB, etc., if needed. */
1098 for (sfx = 0; hsh_insert (short_names, v->short_name) != NULL; sfx++)
1099 var_set_short_name_suffix (v, v->name, sfx);
1103 /* Get rid of hash table. */
1104 hsh_destroy (short_names);