-/* PSPP - computes sample statistics.
- Copyright (C) 1997-9, 2000 Free Software Foundation, Inc.
- Written by Ben Pfaff <blp@gnu.org>.
+/* PSPP - a program for statistical analysis.
+ Copyright (C) 1997-9, 2000, 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 the Free Software Foundation; either version 2 of the
- License, or (at your option) any later version.
+ 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
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
- This program is distributed in the hope that it will be useful, but
- WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- General Public License for more details.
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
- 02110-1301, USA. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <config.h>
#include <data/variable.h>
#include <language/command.h>
#include <language/lexer/lexer.h>
-#include <language/lexer/range-parser.h>
+#include <language/lexer/value-parser.h>
#include <language/lexer/variable-parser.h>
-#include <libpspp/alloc.h>
#include <libpspp/compiler.h>
#include <libpspp/message.h>
#include <libpspp/message.h>
#include <libpspp/pool.h>
#include <libpspp/str.h>
+#include "xalloc.h"
+
#include "gettext.h"
#define _(msgid) gettext (msgid)
struct criteria *next;
/* Variables to count. */
- struct variable **vars;
+ const struct variable **vars;
size_t var_cnt;
- /* Count special values?. */
+ /* Count special values? */
bool count_system_missing; /* Count system missing? */
bool count_user_missing; /* Count user missing? */
- /* Criterion values. */
+ /* Criterion values. */
size_t value_cnt;
union
{
static trns_proc_func count_trns_proc;
static trns_free_func count_trns_free;
-static bool parse_numeric_criteria (struct pool *, struct criteria *);
-static bool parse_string_criteria (struct pool *, struct criteria *);
+static bool parse_numeric_criteria (struct lexer *, struct pool *, struct criteria *);
+static bool parse_string_criteria (struct lexer *, struct pool *, struct criteria *);
\f
int
-cmd_count (void)
+cmd_count (struct lexer *lexer, struct dataset *ds)
{
struct dst_var *dv; /* Destination var being parsed. */
struct count_trns *trns; /* Transformation. */
dv->crit = NULL;
/* Get destination variable, or at least its name. */
- if (!lex_force_id ())
+ if (!lex_force_id (lexer))
goto fail;
- dv->var = dict_lookup_var (default_dict, tokid);
+ dv->var = dict_lookup_var (dataset_dict (ds), lex_tokid (lexer));
if (dv->var != NULL)
{
- if (dv->var->type == ALPHA)
+ if (var_is_alpha (dv->var))
{
msg (SE, _("Destination cannot be a string variable."));
goto fail;
}
}
else
- dv->name = pool_strdup (trns->pool, tokid);
+ dv->name = pool_strdup (trns->pool, lex_tokid (lexer));
- lex_get ();
- if (!lex_force_match ('='))
+ lex_get (lexer);
+ if (!lex_force_match (lexer, '='))
goto fail;
crit = dv->crit = pool_alloc (trns->pool, sizeof *crit);
for (;;)
{
bool ok;
-
+
crit->next = NULL;
crit->vars = NULL;
- if (!parse_variables (default_dict, &crit->vars, &crit->var_cnt,
+ if (!parse_variables_const (lexer, dataset_dict (ds), &crit->vars,
+ &crit->var_cnt,
PV_DUPLICATE | PV_SAME_TYPE))
goto fail;
pool_register (trns->pool, free, crit->vars);
- if (!lex_force_match ('('))
+ if (!lex_force_match (lexer, '('))
goto fail;
crit->value_cnt = 0;
- if (crit->vars[0]->type == NUMERIC)
- ok = parse_numeric_criteria (trns->pool, crit);
+ if (var_is_numeric (crit->vars[0]))
+ ok = parse_numeric_criteria (lexer, trns->pool, crit);
else
- ok = parse_string_criteria (trns->pool, crit);
+ ok = parse_string_criteria (lexer, trns->pool, crit);
if (!ok)
goto fail;
- if (token == '/' || token == '.')
+ if (lex_token (lexer) == '/' || lex_token (lexer) == '.')
break;
crit = crit->next = pool_alloc (trns->pool, sizeof *crit);
}
- if (token == '.')
+ if (lex_token (lexer) == '.')
break;
- if (!lex_force_match ('/'))
+ if (!lex_force_match (lexer, '/'))
goto fail;
dv = dv->next = pool_alloc (trns->pool, sizeof *dv);
}
{
/* It's valid, though motivationally questionable, to count to
the same dest var more than once. */
- dv->var = dict_lookup_var (default_dict, dv->name);
+ dv->var = dict_lookup_var (dataset_dict (ds), dv->name);
- if (dv->var == NULL)
- dv->var = dict_create_var_assert (default_dict, dv->name, 0);
+ if (dv->var == NULL)
+ dv->var = dict_create_var_assert (dataset_dict (ds), dv->name, 0);
}
- add_transformation (count_trns_proc, count_trns_free, trns);
+ add_transformation (ds, count_trns_proc, count_trns_free, trns);
return CMD_SUCCESS;
fail:
/* Parses a set of numeric criterion values. Returns success. */
static bool
-parse_numeric_criteria (struct pool *pool, struct criteria *crit)
+parse_numeric_criteria (struct lexer *lexer, struct pool *pool, struct criteria *crit)
{
size_t allocated = 0;
for (;;)
{
double low, high;
-
- if (lex_match_id ("SYSMIS"))
+
+ if (lex_match_id (lexer, "SYSMIS"))
crit->count_system_missing = true;
- else if (lex_match_id ("MISSING"))
+ else if (lex_match_id (lexer, "MISSING"))
crit->count_user_missing = true;
- else if (parse_num_range (&low, &high, NULL))
+ else if (parse_num_range (lexer, &low, &high, NULL))
{
struct num_value *cur;
else
return false;
- lex_match (',');
- if (lex_match (')'))
+ lex_match (lexer, ',');
+ if (lex_match (lexer, ')'))
break;
}
return true;
/* Parses a set of string criteria values. Returns success. */
static bool
-parse_string_criteria (struct pool *pool, struct criteria *crit)
+parse_string_criteria (struct lexer *lexer, struct pool *pool, struct criteria *crit)
{
int len = 0;
size_t allocated = 0;
size_t i;
for (i = 0; i < crit->var_cnt; i++)
- if (crit->vars[i]->width > len)
- len = crit->vars[i]->width;
+ if (var_get_width (crit->vars[i]) > len)
+ len = var_get_width (crit->vars[i]);
crit->values.str = NULL;
for (;;)
&allocated,
sizeof *crit->values.str);
- if (!lex_force_string ())
+ if (!lex_force_string (lexer))
return false;
cur = &crit->values.str[crit->value_cnt++];
*cur = pool_alloc (pool, len + 1);
- str_copy_rpad (*cur, len + 1, ds_cstr (&tokstr));
- lex_get ();
+ str_copy_rpad (*cur, len + 1, ds_cstr (lex_tokstr (lexer)));
+ lex_get (lexer);
- lex_match (',');
- if (lex_match (')'))
+ lex_match (lexer, ',');
+ if (lex_match (lexer, ')'))
break;
}
/* Transformation. */
/* Counts the number of values in case C matching CRIT. */
-static inline int
-count_numeric (struct criteria *crit, struct ccase *c)
+static int
+count_numeric (struct criteria *crit, const struct ccase *c)
{
int counter = 0;
size_t i;
for (i = 0; i < crit->var_cnt; i++)
{
- double x = case_num (c, crit->vars[i]->fv);
- if (x == SYSMIS)
- counter += crit->count_system_missing;
- else if (crit->count_user_missing
- && mv_is_num_user_missing (&crit->vars[i]->miss, x))
- counter++;
- else
+ double x = case_num (c, crit->vars[i]);
+ if (var_is_num_missing (crit->vars[i], x, MV_ANY))
+ {
+ if (x == SYSMIS
+ ? crit->count_system_missing
+ : crit->count_user_missing)
+ counter++;
+ }
+ else
{
struct num_value *v;
-
+
for (v = crit->values.num; v < crit->values.num + crit->value_cnt;
- v++)
- if (v->type == CNT_SINGLE ? x == v->a : x >= v->a && x <= v->b)
+ v++)
+ if (v->type == CNT_SINGLE ? x == v->a : x >= v->a && x <= v->b)
{
counter++;
break;
- }
+ }
}
}
-
+
return counter;
}
/* Counts the number of values in case C matching CRIT. */
-static inline int
-count_string (struct criteria *crit, struct ccase *c)
+static int
+count_string (struct criteria *crit, const struct ccase *c)
{
int counter = 0;
size_t i;
{
char **v;
for (v = crit->values.str; v < crit->values.str + crit->value_cnt; v++)
- if (!memcmp (case_str (c, crit->vars[i]->fv), *v,
- crit->vars[i]->width))
+ if (!memcmp (case_str (c, crit->vars[i]), *v,
+ var_get_width (crit->vars[i])))
{
counter++;
break;
/* Performs the COUNT transformation T on case C. */
static int
-count_trns_proc (void *trns_, struct ccase *c,
- casenum_t case_num UNUSED)
+count_trns_proc (void *trns_, struct ccase **c,
+ casenumber case_num UNUSED)
{
struct count_trns *trns = trns_;
struct dst_var *dv;
+ *c = case_unshare (*c);
for (dv = trns->dst_vars; dv; dv = dv->next)
{
struct criteria *crit;
counter = 0;
for (crit = dv->crit; crit; crit = crit->next)
- if (crit->vars[0]->type == NUMERIC)
- counter += count_numeric (crit, c);
+ if (var_is_numeric (crit->vars[0]))
+ counter += count_numeric (crit, *c);
else
- counter += count_string (crit, c);
- case_data_rw (c, dv->var->fv)->f = counter;
+ counter += count_string (crit, *c);
+ case_data_rw (*c, dv->var)->f = counter;
}
return TRNS_CONTINUE;
}
projects / pspp-builds.git / blobdiff