return true;
}
-/*
- Do the variables in X->VARS constitute a proper
- subset of the variables in Y->VARS?
- */
-static bool
-is_subset (const struct interaction *x, const struct interaction *y)
-{
- size_t i;
- size_t j;
- size_t n = 0;
-
- if (x->n_vars < y->n_vars)
- {
- 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 (n >= x->n_vars)
- return true;
- return false;
-}
-
-static bool
-drop_from_submodel (const struct interaction *x, const struct interaction *y)
-{
- size_t i;
- size_t j;
- size_t n = 0;
-
- if (is_subset (x, y))
- return true;
-
- 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 (n == x->n_vars)
- {
- return true;
- }
-
- return false;
-}
-
static void
fill_submatrix (gsl_matrix * cov, gsl_matrix * submatrix, size_t * dropped,
size_t n_dropped)
{
const struct interaction * x =
categoricals_get_interaction_by_subscript (cats, i - cmd->n_dep_vars);
- if (is_subset (cmd->interactions [k], x))
+ if (interaction_is_proper_subset (cmd->interactions [k], x))
{
assert (n_dropped_model < covariance_dim (cov));
model_dropped[n_dropped_model++] = i;
}
- if (drop_from_submodel (cmd->interactions [k], x))
+ if (interaction_is_subset (cmd->interactions [k], x))
{
assert (n_dropped_submodel < covariance_dim (cov));
submodel_dropped[n_dropped_submodel++] = i;
}
+/*
+ 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)
{
void interaction_add_variable (struct interaction *, const struct variable *);
void interaction_dump (const struct interaction *);
void interaction_to_string (const struct interaction *iact, struct string *str);
+bool interaction_is_proper_subset (const struct interaction *x, const struct interaction *y);
+bool interaction_is_subset (const struct interaction *x, const struct interaction *y);
struct ccase;