+
+ struct pivot_category **groups = xnmalloc (ft->vars.n,
+ sizeof *groups);
+ for (size_t k = 0; k < n; k++)
+ {
+ struct freq *prev = k > 0 ? ft->sorted[k - 1] : NULL;
+ struct freq *f = ft->sorted[k];
+
+ size_t n_common = 0;
+ if (prev)
+ for (; n_common + 1 < ft->vars.n; n_common++)
+ if (!value_equal (&prev->values[n_common],
+ &f->values[n_common],
+ var_get_type (ft->vars.vars[n_common])))
+ break;
+
+ for (size_t m = n_common; m + 1 < ft->vars.n; m++)
+ groups[m] = pivot_category_create_group__ (
+ m > 0 ? groups[m - 1] : d->root,
+ pivot_value_new_var_value (ft->vars.vars[m], &f->values[m]));
+
+ int leaf = pivot_category_create_leaf (
+ ft->vars.n > 1 ? groups[ft->vars.n - 2] : d->root,
+ pivot_value_new_var_value (ft->vars.vars[ft->vars.n - 1],
+ &f->values[ft->vars.n - 1]));
+
+ pivot_table_put1 (pt, leaf, pivot_value_new_number (f->count));
+ }
+ free (groups);