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");
}
*/
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;
}
assert (cov->state == 1);
cov->state = 2;
- cov->dim = cov->n_vars + categoricals_total (cov->categoricals);
+ cov->dim = cov->n_vars +
+ categoricals_total (cov->categoricals) - categoricals_get_n_variables (cov->categoricals);
+
cov->n_cm = (cov->dim * (cov->dim - 1) ) / 2;
cov->cm = xcalloc (sizeof *cov->cm, cov->n_cm);