#include <data/value.h>
#include <libpspp/hmap.h>
#include <libpspp/pool.h>
+#include <libpspp/array.h>
#include <libpspp/str.h>
Can be used as an index into an array */
};
-
struct var_params
{
/* A map indexed by a union values */
};
+/* Comparison function to sort the reverse_value_map in ascending order */
+static int
+compare_value_node (const void *vn1_, const void *vn2_, const void *aux)
+{
+ const struct value_node * const *vn1 = vn1_;
+ const struct value_node * const *vn2 = vn2_;
+ const struct var_params *vp = aux;
+
+ return value_compare_3way (&(*vn1)->value, &(*vn2)->value, var_get_width (vp->var));
+}
+
+
struct categoricals
{
/* The weight variable */
/* Missing values to be excluded */
enum mv_class exclude;
-
-
/* Function to be called on each update */
update_func *update;
-
/* Function specified by the caller to create user_data */
user_data_create_func *user_data_create;
-
/* Auxilliary data to be passed to update and user_data_create_func*/
void *aux1;
void *aux2;
cat->vp[i].cc += weight;
if (cat->update)
- cat->update (node->user_data, cat->wv, var, c, cat->aux1, cat->aux2);
+ cat->update (node->user_data, cat->exclude, cat->wv, var, c, cat->aux1, cat->aux2);
}
}
vp->reverse_value_map[vn->subscript] = vn;
}
+ /* For some purposes (eg CONTRASTS in ONEWAY) the values need to be sorted */
+ sort (vp->reverse_value_map, vp->n_cats, sizeof (const struct value_node *),
+ compare_value_node, vp);
+
/* Populate the reverse variable map.
*/
for (i = 0; i < vp->n_cats; ++i)
}
assert (cat->n_vars <= cat->n_vp);
+
}