-/* PSPP - computes sample statistics.
+/* PSPP - a program for statistical analysis.
Copyright (C) 2006 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 <stdlib.h>
#include <data/case.h>
+#include <data/case-map.h>
#include <data/casereader.h>
#include <data/casewriter-provider.h>
#include <data/casewriter.h>
#include <data/dictionary.h>
#include <data/file-handle-def.h>
#include <data/scratch-handle.h>
+#include <data/variable.h>
#include <libpspp/compiler.h>
#include <libpspp/taint.h>
{
struct scratch_handle *handle; /* Underlying scratch handle. */
struct file_handle *fh; /* Underlying file handle. */
- struct dict_compactor *compactor; /* Compacts into handle->dictionary. */
+ struct case_map *compactor; /* Compacts into handle->dictionary. */
struct casewriter *subwriter; /* Data output. */
};
struct scratch_handle *sh;
struct scratch_writer *writer;
struct dictionary *scratch_dict;
- struct dict_compactor *compactor;
+ struct case_map *compactor;
struct casewriter *casewriter;
+ size_t dict_value_cnt;
if (!fh_open (fh, FH_REF_SCRATCH, "scratch file", "we"))
return NULL;
/* Copy the dictionary and compact if needed. */
scratch_dict = dict_clone (dictionary);
- if (dict_compacting_would_shrink (scratch_dict))
+ dict_delete_scratch_vars (scratch_dict);
+ if (dict_count_values (scratch_dict, 0)
+ < dict_get_next_value_idx (scratch_dict))
{
- compactor = dict_make_compactor (scratch_dict);
+ compactor = case_map_to_compact_dict (scratch_dict, 0);
dict_compact_values (scratch_dict);
}
else
compactor = NULL;
+ dict_value_cnt = dict_get_next_value_idx (scratch_dict);
/* Create new contents. */
sh = xmalloc (sizeof *sh);
writer->handle = sh;
writer->fh = fh;
writer->compactor = compactor;
- writer->subwriter = autopaging_writer_create (dict_get_next_value_idx (
- scratch_dict));
+ writer->subwriter = autopaging_writer_create (dict_value_cnt);
fh_set_scratch_handle (fh, sh);
- casewriter = casewriter_create (&scratch_writer_casewriter_class, writer);
+ casewriter = casewriter_create (dict_value_cnt,
+ &scratch_writer_casewriter_class, writer);
taint_propagate (casewriter_get_taint (writer->subwriter),
casewriter_get_taint (casewriter));
return casewriter;
struct ccase *c)
{
struct scratch_writer *writer = writer_;
- struct scratch_handle *handle = writer->handle;
struct ccase tmp;
if (writer->compactor)
{
- case_create (&tmp, dict_get_next_value_idx (handle->dictionary));
- dict_compactor_compact (writer->compactor, &tmp, c);
+ case_map_execute (writer->compactor, c, &tmp);
case_destroy (c);
}
else