/* PSPP - a program for statistical analysis.
- Copyright (C) 2009 Free Software Foundation, Inc.
+ Copyright (C) 2011, 2012 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
-/*
- An interaction is a gsl_vector containing a "product" of other
- variables. The variables can be either categorical or numeric.
- If the variables are all numeric, the interaction is just the
- scalar product. If any of the variables are categorical, their
- product is a vector containing 0's in all but one entry. This entry
- is found by combining the vectors corresponding to the variables'
- OBS_VALS member. If there are K categorical variables, each with
- N_1, N_2, ..., N_K categories, then the interaction will have
- N_1 * N_2 * N_3 *...* N_K - 1 entries.
-
- When using these functions, make sure the orders of variables and
- values match when appropriate.
- */
-
#include <config.h>
-#include <assert.h>
-#include <gsl/gsl_math.h>
-#include <gsl/gsl_vector.h>
-#include <data/value.h>
-#include <data/variable.h>
-#include <math/interaction.h>
-#include <string.h>
-#include <xalloc.h>
-
-struct interaction_variable
+
+#include "data/case.h"
+#include "interaction.h"
+
+#include "data/value.h"
+#include "data/variable.h"
+#include "libpspp/str.h"
+
+#include "gl/xalloc.h"
+
+#include <stdio.h>
+
+/* Creates and returns an interaction. If V is nonnull, then the interaction
+ initially contains V, otherwise it is initially empty. */
+struct interaction *
+interaction_create (const struct variable *v)
+{
+ struct interaction *iact = xmalloc (sizeof *iact);
+ iact->vars = xmalloc (sizeof *iact->vars);
+ iact->n_vars = 0;
+ if (v)
+ {
+ iact->vars[0] = v;
+ iact->n_vars = 1;
+ }
+ return iact;
+}
+
+/* Returns a (deep) copy of interaction SRC. */
+struct interaction *
+interaction_clone (const struct interaction *src)
+{
+ struct interaction *dst = xmalloc (sizeof *dst);
+ dst->vars = xmemdup (src->vars, src->n_vars * sizeof *src->vars);
+ dst->n_vars = src->n_vars;
+ return dst;
+}
+
+/* Frees IACT. */
+void
+interaction_destroy (struct interaction *iact)
+{
+ if (iact)
+ {
+ free (iact->vars);
+ free (iact);
+ }
+}
+
+/* Appends variable V to IACT.
+
+ V must not already be in IACT. */
+void
+interaction_add_variable (struct interaction *iact, const struct variable *v)
{
- int n_vars;
- const struct variable **members;
- struct variable *intr;
-};
+ iact->vars = xrealloc (iact->vars, (iact->n_vars + 1) * sizeof *iact->vars);
+ iact->vars[iact->n_vars++] = v;
+}
-struct interaction_value
+/* Returns true iff the variables in X->VARS are a proper subset of the
+ variables in Y->VARS. */
+bool
+interaction_is_proper_subset (const struct interaction *x,
+ const struct interaction *y)
{
- const struct interaction_variable *intr;
- union value *strings; /* Concatenation of the string values in this interaction's value. */
- double f; /* Product of the numerical values in this interaction's value. */
-};
+ return x->n_vars >= y->n_vars && interaction_is_subset (x, y);
+}
+
+static bool
+interaction_contains (const struct interaction *iact, const struct variable *v)
+{
+ for (size_t i = 0; i < iact->n_vars; i++)
+ if (iact->vars[i] == v)
+ return true;
+ return false;
+}
-struct interaction_variable *
-interaction_variable_create (const struct variable **vars, int n_vars)
+/* Returns true iff the variables in X->VARS are a subset (proper or otherwise)
+ of the variables in Y->VARS. */
+bool
+interaction_is_subset (const struct interaction *x,
+ const struct interaction *y)
{
- struct interaction_variable *result = NULL;
- size_t i;
+ if (x->n_vars > y->n_vars)
+ return false;
- if (n_vars > 0)
+ for (size_t i = 0; i < x->n_vars; i++)
+ if (!interaction_contains (y, x->vars[i]))
+ return false;
+
+ return true;
+}
+
+/* Prints the variables in IACT on stdout, for debugging purposes. */
+void
+interaction_dump (const struct interaction *iact)
+{
+ if (iact->n_vars == 0)
+ printf ("(empty)\n");
+ else
{
- result = xmalloc (sizeof (*result));
- result->members = xnmalloc (n_vars, sizeof (*result->members));
- result->intr = var_create_internal (0);
- result->n_vars = n_vars;
- for (i = 0; i < n_vars; i++)
- {
- result->members[i] = vars[i];
- }
+ for (size_t v = 0; v < iact->n_vars; ++v)
+ {
+ printf ("%s", var_get_name (iact->vars[v]));
+ if (v + 1 < iact->n_vars)
+ printf (" * ");
+ }
+ printf ("\n");
}
- return result;
}
-void interaction_variable_destroy (struct interaction_variable *iv)
+/* Appends STR with a representation of the interaction, suitable for user
+ display.
+
+ STR must have been initialised prior to calling this function. */
+void
+interaction_to_string (const struct interaction *iact, struct string *str)
{
- var_destroy (iv->intr);
- free (iv->members);
- free (iv);
+ for (size_t v = 0; v < iact->n_vars; ++v)
+ {
+ ds_put_cstr (str, var_to_string (iact->vars[v]));
+ if (v + 1 < iact->n_vars)
+ ds_put_cstr (str, " × ");
+ }
}
-size_t
-interaction_variable_get_n_vars (const struct interaction_variable *iv)
+/* Returns a hash of the values in C given by variables in IACT, using BASE as
+ a basis for the hash. */
+unsigned int
+interaction_case_hash (const struct interaction *iact,
+ const struct ccase *c, unsigned int base)
{
- return (iv == NULL) ? 0 : iv->n_vars;
+ size_t hash = base;
+ for (size_t i = 0; i < iact->n_vars; ++i)
+ {
+ const struct variable *var = iact->vars[i];
+ const union value *val = case_data (c, var);
+ hash = value_hash (val, var_get_width (var), hash);
+ }
+ return hash;
}
-/*
- Given list of values, compute the value of the corresponding
- interaction. This "value" is not stored as the typical vector of
- 0's and one double, but rather the string values are concatenated to
- make one big string value, and the numerical values are multiplied
- together to give the non-zero entry of the corresponding vector.
- */
-struct interaction_value *
-interaction_value_create (const struct interaction_variable *var, const union value **vals)
+/* Returns true iff all the variables in IACT have equal values in C1 and
+ C2. */
+bool
+interaction_case_equal (const struct interaction *iact,
+ const struct ccase *c1, const struct ccase *c2)
{
- struct interaction_value *result = NULL;
- size_t i;
- size_t n_vars;
-
- if (var != NULL)
+ for (size_t i = 0; i < iact->n_vars; ++i)
{
- result = xmalloc (sizeof (*result));
- result->intr = var;
- n_vars = interaction_variable_get_n_vars (var);
- result->strings = value_create (n_vars * MAX_SHORT_STRING + 1);
- result->f = 1.0;
- for (i = 0; i < n_vars; i++)
- {
- if (var_is_alpha (var->members[i]))
- {
- strncat (result->strings->s, vals[i]->s, MAX_SHORT_STRING);
- }
- else if (var_is_numeric (var->members[i]))
- {
- result->f *= vals[i]->f;
- }
- }
+ const struct variable *var = iact->vars[i];
+ if (!value_equal (case_data (c1, var), case_data (c2, var),
+ var_get_width (var)))
+ return false;
}
- return result;
+
+ return true;
}
-void
-interaction_value_destroy (struct interaction_value *val)
+/* Returns a strcmp()-like comparison result for the variables in IACT and
+ their values in C1 and C2. */
+int
+interaction_case_cmp_3way (const struct interaction *iact,
+ const struct ccase *c1, const struct ccase *c2)
{
- if (val != NULL)
+ for (size_t i = 0; i < iact->n_vars; ++i)
{
- free (val->strings);
- free (val);
+ const struct variable *var = iact->vars[i];
+ int cmp = value_compare_3way (case_data (c1, var), case_data (c2, var),
+ var_get_width (var));
+ if (cmp)
+ return cmp;
}
+
+ return 0;
+}
+
+/* Returns true iff any of the variables in IACT have a missing value in C,
+ using EXCLUDE to decide which kinds of missing values to count. */
+bool
+interaction_case_is_missing (const struct interaction *iact,
+ const struct ccase *c, enum mv_class exclude)
+{
+ for (size_t i = 0; i < iact->n_vars; ++i)
+ if (var_is_value_missing (iact->vars[i], case_data (c, iact->vars[i]))
+ & exclude)
+ return true;
+
+ return false;
}
projects / pspp / blobdiff