1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 2011 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/>. */
19 #include "data/case.h"
20 #include "interaction.h"
22 #include "data/value.h"
23 #include "data/variable.h"
24 #include "libpspp/str.h"
26 #include "gl/xalloc.h"
32 An interaction is a structure containing a "product" of other
33 variables. The variables can be either string or numeric.
35 Interaction is commutative. That means, that from a mathematical point of
36 view, the order of the variables is irrelevant. However, for display
37 purposes, and for matching with an interaction's value the order is
40 Therefore, when using these functions, make sure the orders of variables
41 and values match when appropriate.
47 interaction_create (const struct variable *v)
49 struct interaction *i = xmalloc (sizeof *i);
50 i->vars = xmalloc (sizeof *i->vars);
61 interaction_destroy (struct interaction *i)
68 interaction_add_variable (struct interaction *i, const struct variable *v)
70 i->vars = xrealloc (i->vars, sizeof (*i->vars) * ++i->n_vars);
71 i->vars[i->n_vars - 1] = v;
76 interaction_dump (const struct interaction *i)
79 printf ("%s", var_get_name (i->vars[v]));
80 for (v = 1; v < i->n_vars; ++v)
82 printf (" * %s", var_get_name (i->vars[v]));
87 /* Appends STR with a representation of the interaction, suitable for user
90 STR must have been initialised prior to calling this function.
93 interaction_to_string (const struct interaction *iact, struct string *str)
96 ds_put_cstr (str, var_to_string (iact->vars[v]));
97 for (v = 1; v < iact->n_vars; ++v)
99 ds_put_cstr (str, " * ");
100 ds_put_cstr (str, var_to_string (iact->vars[v]));
105 interaction_case_hash (const struct interaction *iact, const struct ccase *c)
109 for (i = 0; i < iact->n_vars; ++i)
111 const struct variable *var = iact->vars[i];
112 const union value *val = case_data (c, var);
113 hash = value_hash (val, var_get_width (var), hash);
119 interaction_case_equal (const struct interaction *iact, const struct ccase *c1, const struct ccase *c2)
124 for (i = 0; i < iact->n_vars; ++i)
126 const struct variable *var = iact->vars[i];
127 if ( ! value_equal (case_data (c1, var), case_data (c2, var), var_get_width (var)))
139 interaction_case_cmp_3way (const struct interaction *iact, const struct ccase *c1, const struct ccase *c2)
144 for (i = 0; i < iact->n_vars; ++i)
146 const struct variable *var = iact->vars[i];
147 result = value_compare_3way (case_data (c1, var), case_data (c2, var), var_get_width (var));
157 interaction_case_is_missing (const struct interaction *iact, const struct ccase *c, enum mv_class exclude)
160 bool missing = false;
162 for (i = 0; i < iact->n_vars; ++i)
164 if ( var_is_value_missing (iact->vars[i], case_data (c, iact->vars[i]), exclude))