const union value *group = case_data (c, nst->indep_var);
const size_t group_var_width = var_get_width (nst->indep_var);
- if ( value_equal (group, &nst->val1, group_var_width))
+ if (value_equal (group, &nst->val1, group_var_width))
return true;
- if ( value_equal (group, &nst->val2, group_var_width))
+ if (value_equal (group, &nst->val2, group_var_width))
return true;
return false;
const struct caseproto *proto = casereader_get_proto (input);
size_t rank_idx = caseproto_get_n_widths (proto);
- struct mw *mw = xcalloc (nst->n_vars, sizeof *mw);
+ struct mw *mw = XCALLOC (nst->n_vars, struct mw);
for (i = 0; i < nst->n_vars; ++i)
{
{
const union value *group = case_data (c, nst->indep_var);
const size_t group_var_width = var_get_width (nst->indep_var);
- const double rank = case_data_idx (c, rank_idx)->f;
+ const double rank = case_num_idx (c, rank_idx);
- if ( value_equal (group, &nst->val1, group_var_width))
+ if (value_equal (group, &nst->val1, group_var_width))
{
mw[i].rank_sum[0] += rank;
mw[i].n[0] += dict_get_case_weight (dict, c, &warn);
}
- else if ( value_equal (group, &nst->val2, group_var_width))
+ else if (value_equal (group, &nst->val2, group_var_width))
{
mw[i].rank_sum[1] += rank;
mw[i].n[1] += dict_get_case_weight (dict, c, &warn);
mwv->u -= mwv->rank_sum[0];
mwv->w = mwv->rank_sum[1];
- if ( mwv->u > mwv->n[0] * mwv->n[1] / 2.0)
+ if (mwv->u > mwv->n[0] * mwv->n[1] / 2.0)
{
mwv->u = mwv->n[0] * mwv->n[1] - mwv->u;
mwv->w = mwv->rank_sum[0];