/* PSPP - a program for statistical analysis.
- Copyright (C) 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
+ Copyright (C) 2009, 2010, 2011, 2012, 2014 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#include "math/categoricals.h"
#include "math/interaction.h"
+#include <float.h>
#include <stdio.h>
#include "data/case.h"
#define CATEGORICALS_DEBUG 0
-#define EFFECTS_CODING 1
-
struct value_node
{
struct hmap_node node; /* Node in hash map. */
int index; /* A zero based unique index for this value */
};
+
struct interaction_value
{
struct hmap_node node; /* Node in hash map */
- struct ccase *ccase; /* A case (probably the first in the dataset) which matches this value */
+ struct ccase *ccase; /* A case (probably the first in the dataset) which matches
+ this value */
- double cc; /* Total of the weights of cases matching this interaction */
+ double cc; /* Total of the weights of cases matching this interaction */
void *user_data; /* A pointer to data which the caller can store stuff */
};
int n_vals; /* Number of values for this variable */
};
+
+/* Comparison function to sort value_nodes in ascending order */
+static int
+compare_value_node_3way (const void *vn1_, const void *vn2_, const void *aux)
+{
+ const struct value_node *const *vn1p = vn1_;
+ const struct value_node *const *vn2p = vn2_;
+
+ const struct variable_node *vn = aux;
+
+
+ return value_compare_3way (&(*vn1p)->val, &(*vn2p)->val, var_get_width (vn->var));
+}
+
+
+
static struct variable_node *
lookup_variable (const struct hmap *map, const struct variable *var, unsigned int hash)
{
if (vn->var == var)
break;
- fprintf (stderr, "Warning: Hash table collision\n");
+ fprintf (stderr, "%s:%d Warning: Hash table collision\n", __FILE__, __LINE__);
}
return vn;
/* A map of cases indexed by a interaction_value */
struct hmap ivmap;
- struct interaction *iact;
+ const struct interaction *iact;
int base_subscript_short;
int base_subscript_long;
}
printf ("\n");
-
printf ("Number of interactions %d\n", cat->n_iap);
for (i = 0 ; i < cat->n_iap; ++i)
{
ds_init_empty (&str);
interaction_to_string (iact, &str);
- printf ("\nInteraction: %s (n: %d); ", ds_cstr (&str), iap->n_cats);
+ printf ("\nInteraction: \"%s\" (number of categories: %d); ", ds_cstr (&str), iap->n_cats);
ds_destroy (&str);
- printf ("Base subscript: %d\n", iap->base_subscript_short);
+ printf ("Base index (short/long): %d/%d\n", iap->base_subscript_short, iap->base_subscript_long);
printf ("\t(");
for (v = 0; v < hmap_count (&iap->ivmap); ++v)
{
int vv;
const struct interaction_value *iv = iap->reverse_interaction_value_map[v];
-
+
if (v > 0) printf (" ");
printf ("{");
for (vv = 0; vv < iact->n_vars; ++vv)
{
const struct variable *var = iact->vars[vv];
const union value *val = case_data (iv->ccase, var);
-
- printf ("%g", val->f);
+ unsigned int varhash = hash_pointer (var, 0);
+ struct variable_node *vn = lookup_variable (&cat->varmap, var, varhash);
+
+ const int width = var_get_width (var);
+ unsigned int valhash = value_hash (val, width, 0);
+ struct value_node *valn = lookup_value (&vn->valmap, val, valhash, width);
+
+ assert (vn->var == var);
+
+ printf ("%.*g(%d)", DBL_DIG + 1, val->f, valn->index);
if (vv < iact->n_vars - 1)
printf (", ");
}
int i;
if (NULL == cat)
return;
+
for (i = 0; i < cat->n_iap; ++i)
{
struct interaction_value *iv = NULL;
free (cat->iap[i].enc_sum);
free (cat->iap[i].df_prod);
hmap_destroy (&cat->iap[i].ivmap);
- interaction_destroy (cat->iap[i].iact);
}
/* Interate over each variable and delete its value map */
if (valn == NULL)
{
valn = pool_malloc (cat->pool, sizeof *valn);
- valn->index = vn->n_vals++;
+ valn->index = -1;
+ vn->n_vals++;
value_init (&valn->val, width);
value_copy (&valn->val, val, width);
hmap_insert (&vn->valmap, &valn->node, hash);
}
- }
+ }
for (i = 0 ; i < cat->n_iap; ++i)
{
if ( NULL == node)
{
node = pool_malloc (cat->pool, sizeof *node);
-
node->ccase = case_ref (c);
node->cc = weight;
for (v = 0 ; v < iact->n_vars; ++v)
{
+ int x;
const struct variable *var = iact->vars[v];
struct variable_node *vn = lookup_variable (&cat->varmap, var, hash_pointer (var, 0));
- if (hmap_count (&vn->valmap) == 0)
+ struct value_node *valnd = NULL;
+ struct value_node **array ;
+
+ assert (vn->n_vals == hmap_count (&vn->valmap));
+
+ if (vn->n_vals == 0)
{
cat->sane = false;
return;
}
- cat->iap[i].df_prod[v] = df * (hmap_count (&vn->valmap) - 1);
+ /* Sort the VALMAP here */
+ array = xcalloc (sizeof *array, vn->n_vals);
+ x = 0;
+ HMAP_FOR_EACH (valnd, struct value_node, node, &vn->valmap)
+ {
+ /* Note: This loop is probably superfluous, it could be done in the
+ update stage (at the expense of a realloc) */
+ array[x++] = valnd;
+ }
+
+ sort (array, vn->n_vals, sizeof (*array),
+ compare_value_node_3way, vn);
+
+ for (x = 0; x < vn->n_vals; ++x)
+ {
+ struct value_node *vvv = array[x];
+ vvv->index = x;
+ }
+ free (array);
+
+ cat->iap[i].df_prod[v] = df * (vn->n_vals - 1);
df = cat->iap[i].df_prod[v];
- cat->iap[i].n_cats *= hmap_count (&vn->valmap);
+ cat->iap[i].n_cats *= vn->n_vals;
}
- assert (v == iact->n_vars);
if (v > 0)
cat->df_sum += cat->iap[i].df_prod [v - 1];
struct interaction_value *iv = iap->reverse_interaction_value_map[y];
for (x = iap->base_subscript_short; x < iap->base_subscript_short + df ;++x)
{
- const double bin = categoricals_get_code_for_case (cat, x, iv->ccase); \
+ const double bin = categoricals_get_effects_code_for_case (cat, x, iv->ccase);
iap->enc_sum [x - iap->base_subscript_short] += bin * iv->cc;
}
if (cat->payload && cat->payload->calculate)
return vp->enc_sum[subscript - vp->base_subscript_short];
}
+
/* Returns unity if the value in case C at SUBSCRIPT is equal to the category
for that subscript */
-double
+static double
categoricals_get_code_for_case (const struct categoricals *cat, int subscript,
- const struct ccase *c)
+ const struct ccase *c,
+ bool effects_coding)
{
const struct interaction *iact = categoricals_get_interaction_by_subscript (cat, subscript);
const int index = ((subscript - base_index) % iap->df_prod[v] ) / dfp;
dfp = iap->df_prod [v];
-#if EFFECTS_CODING
- if ( valn->index == df )
+ if (effects_coding && valn->index == df )
bin = -1.0;
- else
-#endif
- if ( valn->index != index )
- bin = 0;
+ else if ( valn->index != index )
+ bin = 0;
result *= bin;
}
}
+/* Returns unity if the value in case C at SUBSCRIPT is equal to the category
+ for that subscript */
+double
+categoricals_get_dummy_code_for_case (const struct categoricals *cat, int subscript,
+ const struct ccase *c)
+{
+ return categoricals_get_code_for_case (cat, subscript, c, false);
+}
+
+/* Returns unity if the value in case C at SUBSCRIPT is equal to the category
+ for that subscript.
+ Else if it is the last category, return -1.
+ Otherwise return 0.
+ */
+double
+categoricals_get_effects_code_for_case (const struct categoricals *cat, int subscript,
+ const struct ccase *c)
+{
+ return categoricals_get_code_for_case (cat, subscript, c, true);
+}
+
+
size_t
categoricals_get_n_variables (const struct categoricals *cat)
{
projects / pspp / blobdiff