X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Fmath%2Finteraction.c;h=a36755b541265fbc3da3e1ca8fcc465ec0ea120e;hb=59c87092f400493fbc95ee72e5cd8bf02468ce01;hp=d24166d4379b18bf7e7b84c976b6cd4ad2aa4ad8;hpb=32ee0e0402d6d56674f53a47d879ec5c07dabe09;p=pspp diff --git a/src/math/interaction.c b/src/math/interaction.c index d24166d437..a36755b541 100644 --- a/src/math/interaction.c +++ b/src/math/interaction.c @@ -1,5 +1,5 @@ /* PSPP - a program for statistical analysis. - Copyright (C) 2011 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 @@ -42,7 +42,6 @@ */ - struct interaction * interaction_create (const struct variable *v) { @@ -57,9 +56,30 @@ interaction_create (const struct variable *v) return i; } +/* Deep copy an interaction */ +struct interaction * +interaction_clone (const struct interaction *iact) +{ + int v; + struct interaction *i = xmalloc (sizeof *i); + i->vars = xcalloc (iact->n_vars, sizeof *i->vars); + i->n_vars = iact->n_vars; + + for (v = 0; v < iact->n_vars; ++v) + { + i->vars[v] = iact->vars[v]; + } + + return i; +} + + void interaction_destroy (struct interaction *i) { + if (NULL == i) + return; + free (i->vars); free (i); } @@ -72,15 +92,68 @@ interaction_add_variable (struct interaction *i, const struct variable *v) } +/* + Do the variables in X->VARS constitute a proper + subset of the variables in Y->VARS? + */ +bool +interaction_is_proper_subset (const struct interaction *x, const struct interaction *y) +{ + if (x->n_vars >= y->n_vars) + return false; + + return interaction_is_subset (x, y); +} + +/* + Do the variables in X->VARS constitute a + subset (proper or otherwise) of the variables in Y->VARS? + */ +bool +interaction_is_subset (const struct interaction *x, const struct interaction *y) +{ + size_t i; + size_t j; + size_t n = 0; + + /* By definition, a subset cannot have more members than its superset */ + if (x->n_vars > y->n_vars) + return false; + + /* Count the number of values which are members of both sets */ + for (i = 0; i < x->n_vars; i++) + { + for (j = 0; j < y->n_vars; j++) + { + if (x->vars [i] == y->vars [j]) + { + n++; + } + } + } + + /* If ALL the members of X were also found in Y, then this must be a subset */ + if (n >= x->n_vars) + return true; + + return false; +} + + + + void interaction_dump (const struct interaction *i) { int v = 0; - printf ("%s", var_get_name (i->vars[v])); - for (v = 1; v < i->n_vars; ++v) + if ( i->n_vars == 0) { - printf (" * %s", var_get_name (i->vars[v])); + printf ("(empty)\n"); + return; } + printf ("%s", var_get_name (i->vars[v])); + for (v = 1; v < i->n_vars; ++v) + printf (" * %s", var_get_name (i->vars[v])); printf ("\n"); } @@ -93,6 +166,8 @@ void interaction_to_string (const struct interaction *iact, struct string *str) { int v = 0; + if ( iact->n_vars == 0) + return; ds_put_cstr (str, var_to_string (iact->vars[v])); for (v = 1; v < iact->n_vars; ++v) { @@ -102,10 +177,10 @@ interaction_to_string (const struct interaction *iact, struct string *str) } unsigned int -interaction_case_hash (const struct interaction *iact, const struct ccase *c) +interaction_case_hash (const struct interaction *iact, const struct ccase *c, unsigned int base) { int i; - size_t hash = 0; + size_t hash = base; for (i = 0; i < iact->n_vars; ++i) { const struct variable *var = iact->vars[i];