/* PSPP - a program for statistical analysis.
- Copyright (C) 2005 Free Software Foundation, Inc.
+ Copyright (C) 2005, 2009 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 <config.h>
#include <assert.h>
+#include <data/category.h>
+#include <data/value.h>
+#include <data/variable.h>
+#include <gl/xalloc.h>
+#include <libpspp/message.h>
#include <stdlib.h>
#include <string.h>
-#include <libpspp/message.h>
-#include "category.h"
-#include "value.h"
-#include "variable.h"
-
-#include "xalloc.h"
-
-#define CAT_VALUE_NOT_FOUND -2
+#define CAT_VALUE_NOT_FOUND -1
#define N_INITIAL_CATEGORIES 1
track of the number of
values stored.
*/
+ size_t *value_counts; /* Element i stores the number of cases for which
+ the categorical variable has that corresponding
+ value. This is necessary for computing covariance
+ matrices.
+ */
};
void
obs_vals->n_categories = 0;
obs_vals->n_allocated_categories = N_INITIAL_CATEGORIES;
obs_vals->vals = xnmalloc (N_INITIAL_CATEGORIES, sizeof *obs_vals->vals);
+ obs_vals->value_counts = xnmalloc (N_INITIAL_CATEGORIES, sizeof *obs_vals->value_counts);
var_set_obs_vals (v, obs_vals);
}
}
if (obs_vals != NULL)
{
if (obs_vals->n_allocated_categories > 0)
- free (obs_vals->vals);
+ {
+ free (obs_vals->vals);
+ free (obs_vals->value_counts);
+ }
free (obs_vals);
}
}
{
candidate = obs_vals->vals + i;
assert (candidate != NULL);
- if (!compare_values (candidate, val, var_get_width (v)))
+ if (value_equal (candidate, val, var_get_width (v)))
{
return i;
}
}
/*
- Add the new value unless it is already present.
+ Add the new value unless it is already present. Increment the count.
*/
void
cat_value_update (const struct variable *v, const union value *val)
{
if (var_is_alpha (v))
{
+ size_t i;
struct cat_vals *cv = var_get_obs_vals (v);
- if (cat_value_find (v, val) == CAT_VALUE_NOT_FOUND)
+ i = cat_value_find (v, val);
+ if (i == CAT_VALUE_NOT_FOUND)
{
if (cv->n_categories >= cv->n_allocated_categories)
{
cv->vals = xnrealloc (cv->vals,
cv->n_allocated_categories,
sizeof *cv->vals);
+ cv->value_counts = xnrealloc (cv->value_counts, cv->n_allocated_categories,
+ sizeof *cv->value_counts);
}
cv->vals[cv->n_categories] = *val;
+ cv->value_counts[cv->n_categories] = 1;
cv->n_categories++;
}
+ else
+ {
+ cv->value_counts[i]++;
+ }
+ }
+}
+/*
+ Return the count for the sth category.
+ */
+size_t
+cat_get_category_count (const size_t s, const struct variable *v)
+{
+ struct cat_vals *tmp;
+ size_t n_categories;
+
+ tmp = var_get_obs_vals (v);
+ n_categories = cat_get_n_categories (v);
+ if (s < n_categories)
+ {
+ return tmp->value_counts[s];
}
+ return CAT_VALUE_NOT_FOUND;
}
const union value *
return var_get_obs_vals (v)->n_categories;
}
+/*
+ If VAR is categorical with d categories, its first category should
+ correspond to the origin in d-dimensional Euclidean space.
+ */
+bool
+cat_is_origin (const struct variable *var, const union value *val)
+{
+ if (var_is_numeric (var))
+ {
+ return false;
+ }
+ if (cat_value_find (var, val) == 0)
+ {
+ return true;
+ }
+ return false;
+}