printf ("Number of categorical variables: %d\n", cat->n_vp);
printf ("Number of non-empty categorical variables: %d\n", cat->n_vars);
printf ("Total number of categories: %d\n", cat->n_cats_total);
+
+ printf ("\nReverse variable map:\n");
+
+ for (v = 0 ; v < cat->n_cats_total - cat->n_vars; ++v)
+ printf ("%d ", cat->reverse_variable_map[v]);
+ printf ("\n");
}
}
-/* Return the index for value VAL in the Nth variable */
-int
-categoricals_index (const struct categoricals *cat, size_t n, const union value *val)
-{
- struct value_node *vn = lookup_value (&cat->vp[n].map, cat->vp[n].var, val);
-
- if ( vn == NULL)
- return -1;
-
- return vn->subscript;
-}
-
-
/* Return the total number of categories */
size_t
categoricals_total (const struct categoricals *cat)
*/
int v;
int idx = 0;
- cat->reverse_variable_map = pool_calloc (cat->pool, cat->n_cats_total, sizeof *cat->reverse_variable_map);
+ cat->reverse_variable_map = pool_calloc (cat->pool,
+ cat->n_cats_total - cat->n_vars,
+ sizeof *cat->reverse_variable_map);
for (v = 0 ; v < cat->n_vp; ++v)
{
vp->reverse_value_map[vn->subscript] = vn;
}
- for (i = 0; i < vp->n_cats; ++i)
+ /* Populate the reverse variable map.
+ This implementation considers the first value of each categorical variable
+ as the basis. Therefore, this loop starts from 1 instead of 0 */
+ for (i = 1; i < vp->n_cats; ++i)
cat->reverse_variable_map[idx++] = v;
}