1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU 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, see <http://www.gnu.org/licenses/>. */
18 #include <data/value.h>
20 #include <data/val-type.h>
21 #include <libpspp/hash.h>
22 #include <libpspp/str.h>
28 The caller is responsible for freeing the returned value. */
30 value_dup (const union value *val, int width)
32 return xmemdup (val, MAX (width, sizeof *val));
36 /* Create a value of specified width.
37 The caller is responsible for freeing the returned value. */
39 value_create (int width)
41 return xnmalloc (value_cnt_from_width (width), sizeof (union value));
45 /* Compares A and B, which both have the given WIDTH, and returns
46 a strcmp()-type result.
47 Only the short string portion of longer strings are
50 compare_values_short (const void *a_, const void *b_, const void *var_)
52 const union value *a = a_;
53 const union value *b = b_;
54 const struct variable *var = var_;
55 int width = var_get_width (var);
56 return value_compare_3way (a, b, MIN (width, MAX_SHORT_STRING));
60 /* Create a hash of V, which has the given WIDTH.
61 Only the short string portion of a longer string is hashed. */
63 hash_value_short (const void *v_, const void *var_)
65 const union value *v = v_;
66 const struct variable *var = var_;
67 int width = var_get_width (var);
69 ? hsh_hash_double (v->f)
70 : hsh_hash_bytes (v->s, width));
74 /* Copies SRC to DST, given that they both contain data of the
77 value_copy (union value *dst, const union value *src, int width)
82 memcpy (dst->s, src->s, width);
85 /* Sets V to the system-missing value for data of the given
88 value_set_missing (union value *v, int width)
93 memset (v->s, ' ', width);
96 /* Tests whether VALUE may be resized from OLD_WIDTH to
97 NEW_WIDTH, using the following rules that match those for
98 resizing missing values and value labels. First, OLD_WIDTH
99 and NEW_WIDTH must be both numeric or both string. Second, if
100 NEW_WIDTH is less than OLD_WIDTH, then the bytes that would be
101 trimmed off the right end of VALUE must be all spaces. */
103 value_is_resizable (const union value *value, int old_width, int new_width)
107 if (val_type_from_width (old_width) != val_type_from_width (new_width))
109 for (i = new_width; i < old_width; i++)
110 if (value->s[i] != ' ')
115 /* Resizes VALUE from OLD_WIDTH to NEW_WIDTH. The arguments must
116 satisfy the rules specified above for value_is_resizable. */
118 value_resize (union value *value, int old_width, int new_width)
120 assert (value_is_resizable (value, old_width, new_width));
121 if (new_width > old_width)
122 memset (&value->s[old_width], ' ', new_width - old_width);
125 /* Compares A and B, which both have the given WIDTH, and returns
126 a strcmp()-type result. */
128 value_compare_3way (const union value *a, const union value *b, int width)
131 ? (a->f < b->f ? -1 : a->f > b->f)
132 : memcmp (a->s, b->s, width));