nest->areas[at] = xmalloc (nest->n * sizeof *nest->areas[at]);
nest->n_areas[at] = 0;
- bool add_vars = (at == CTAT_LAYER ? a == PIVOT_AXIS_LAYER
- : at == CTAT_LAYERROW ? a != PIVOT_AXIS_COLUMN
- : at == CTAT_LAYERCOL ? a != PIVOT_AXIS_ROW
- : at == CTAT_TABLE ? false
- : true);
- if (add_vars)
- for (size_t k = 0; k < nest->n; k++)
- {
- if (k == nest->scale_idx)
- continue;
- nest->areas[at][nest->n_areas[at]++] = k;
- }
- else if ((at == CTAT_LAYERCOL && a == PIVOT_AXIS_ROW && t->label_axis[a] != a)
- || (at == CTAT_LAYERROW && a == PIVOT_AXIS_COLUMN && t->label_axis[a] != a)
- || (at == CTAT_LAYER && t->label_axis[a] == PIVOT_AXIS_LAYER))
- {
- for (size_t k = nest->n - 1; k < nest->n; k--)
- {
- if (k == nest->scale_idx)
- continue;
- nest->areas[at][nest->n_areas[at]++] = k;
- break;
- }
- continue;
- }
-
enum pivot_axis_type ata, atb;
if (at == CTAT_ROW || at == CTAT_LAYERROW)
{
atb = PIVOT_AXIS_ROW;
}
- size_t n_drop = 0;
- bool drop_inner = false;
+ if (((at == CTAT_LAYERCOL || at == CTAT_LAYERROW)
+ && a == atb && t->label_axis[a] != a)
+ || (at == CTAT_LAYER
+ && a != PIVOT_AXIS_LAYER
+ && t->label_axis[a] == PIVOT_AXIS_LAYER))
+ {
+ for (size_t k = nest->n - 1; k < nest->n; k--)
+ if (k != nest->scale_idx)
+ {
+ nest->areas[at][nest->n_areas[at]++] = k;
+ break;
+ }
+ continue;
+ }
+
+ if (at == CTAT_LAYER ? a == PIVOT_AXIS_LAYER
+ : at == CTAT_LAYERROW || at == CTAT_LAYERCOL ? a != atb
+ : at == CTAT_TABLE ? false
+ : true)
+ for (size_t k = 0; k < nest->n; k++)
+ {
+ if (k == nest->scale_idx)
+ continue;
+ nest->areas[at][nest->n_areas[at]++] = k;
+ }
+
+ int n_drop = 0;
switch (at)
{
case CTAT_SUBTABLE:
else if (t->clabels_to_axis != PIVOT_AXIS_LAYER)
n_drop = a == t->clabels_from_axis ? 2 : 0;
else if (a == t->clabels_from_axis)
- drop_inner = true;
+ n_drop = -1;
else
n_drop = a != PIVOT_AXIS_LAYER;
break;
if (a == atb)
{
if (t->clabels_from_axis == atb)
- drop_inner = true;
+ n_drop = -1;
else if (t->clabels_to_axis != atb)
n_drop = 1;
}
break;
}
- if (drop_inner)
+ if (n_drop < 0)
{
size_t n = nest->n_areas[at];
if (n > 1)
nest->n_areas[at]--;
}
}
- for (size_t i = 0; i < n_drop; i++)
- if (nest->n_areas[at] > 0)
- nest->n_areas[at]--;
+ else
+ {
+ for (int i = 0; i < n_drop; i++)
+ if (nest->n_areas[at] > 0)
+ nest->n_areas[at]--;
+ }
}
}
}