1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 1997-9, 2000, 2007, 2009 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>. */
20 * Remember that histograms, bar charts need mean, stddev.
27 #include <gsl/gsl_histogram.h>
29 #include <data/case.h>
30 #include <data/casegrouper.h>
31 #include <data/casereader.h>
32 #include <data/dictionary.h>
33 #include <data/format.h>
34 #include <data/procedure.h>
35 #include <data/settings.h>
36 #include <data/value-labels.h>
37 #include <data/variable.h>
38 #include <language/command.h>
39 #include <language/dictionary/split-file.h>
40 #include <language/lexer/lexer.h>
41 #include <libpspp/array.h>
42 #include <libpspp/bit-vector.h>
43 #include <libpspp/compiler.h>
44 #include <libpspp/hash.h>
45 #include <libpspp/message.h>
46 #include <libpspp/misc.h>
47 #include <libpspp/pool.h>
48 #include <libpspp/str.h>
49 #include <math/histogram.h>
50 #include <math/moments.h>
51 #include <output/chart.h>
52 #include <output/charts/piechart.h>
53 #include <output/charts/plot-hist.h>
54 #include <output/manager.h>
55 #include <output/output.h>
56 #include <output/table.h>
64 #define _(msgid) gettext (msgid)
65 #define N_(msgid) msgid
72 +format=cond:condense/onepage(*n:onepage_limit,"%s>=0")/!standard,
73 table:limit(n:limit,"%s>0")/notable/!table,
74 labels:!labels/nolabels,
75 sort:!avalue/dvalue/afreq/dfreq,
76 spaces:!single/double,
77 paging:newpage/!oldpage;
78 missing=miss:include/!exclude;
79 barchart(ba_)=:minimum(d:min),
81 scale:freq(*n:freq,"%s>0")/percent(*n:pcnt,"%s>0");
82 piechart(pie_)=:minimum(d:min),
84 missing:missing/!nomissing;
85 histogram(hi_)=:minimum(d:min),
87 scale:freq(*n:freq,"%s>0")/percent(*n:pcnt,"%s>0"),
88 norm:!nonormal/normal,
89 incr:increment(d:inc,"%s>0");
90 hbar(hb_)=:minimum(d:min),
92 scale:freq(*n:freq,"%s>0")/percent(*n:pcnt,"%s>0"),
93 norm:!nonormal/normal,
94 incr:increment(d:inc,"%s>0");
97 +percentiles = double list;
98 +statistics[st_]=1|mean,2|semean,3|median,4|mode,5|stddev,6|variance,
99 7|kurtosis,8|skewness,9|range,10|minimum,11|maximum,12|sum,
100 13|default,14|seskewness,15|sekurtosis,all,none.
108 frq_mean = 0, frq_semean, frq_median, frq_mode, frq_stddev, frq_variance,
109 frq_kurt, frq_sekurt, frq_skew, frq_seskew, frq_range, frq_min, frq_max,
113 /* Description of a statistic. */
116 int st_indx; /* Index into a_statistics[]. */
117 const char *s10; /* Identifying string. */
120 /* Table of statistics, indexed by dsc_*. */
121 static const struct frq_info st_name[frq_n_stats + 1] =
123 {FRQ_ST_MEAN, N_("Mean")},
124 {FRQ_ST_SEMEAN, N_("S.E. Mean")},
125 {FRQ_ST_MEDIAN, N_("Median")},
126 {FRQ_ST_MODE, N_("Mode")},
127 {FRQ_ST_STDDEV, N_("Std Dev")},
128 {FRQ_ST_VARIANCE, N_("Variance")},
129 {FRQ_ST_KURTOSIS, N_("Kurtosis")},
130 {FRQ_ST_SEKURTOSIS, N_("S.E. Kurt")},
131 {FRQ_ST_SKEWNESS, N_("Skewness")},
132 {FRQ_ST_SESKEWNESS, N_("S.E. Skew")},
133 {FRQ_ST_RANGE, N_("Range")},
134 {FRQ_ST_MINIMUM, N_("Minimum")},
135 {FRQ_ST_MAXIMUM, N_("Maximum")},
136 {FRQ_ST_SUM, N_("Sum")},
140 /* Percentiles to calculate. */
144 double p; /* the %ile to be calculated */
145 double value; /* the %ile's value */
146 double x1; /* The datum value <= the percentile */
147 double x2; /* The datum value >= the percentile */
149 int flag2; /* Set to 1 if this percentile value has been found */
153 static void add_percentile (double x) ;
155 static struct percentile *percentiles;
156 static int n_percentiles;
158 /* Groups of statistics. */
160 #define frq_default \
161 (BI (frq_mean) | BI (frq_stddev) | BI (frq_min) | BI (frq_max))
163 (BI (frq_sum) | BI(frq_min) | BI(frq_max) \
164 | BI(frq_mean) | BI(frq_semean) | BI(frq_stddev) \
165 | BI(frq_variance) | BI(frq_kurt) | BI(frq_sekurt) \
166 | BI(frq_skew) | BI(frq_seskew) | BI(frq_range) \
167 | BI(frq_range) | BI(frq_mode) | BI(frq_median))
169 /* Statistics; number of statistics. */
170 static unsigned long stats;
173 /* Types of graphs. */
176 GFT_NONE, /* Don't draw graphs. */
177 GFT_BAR, /* Draw bar charts. */
178 GFT_HIST, /* Draw histograms. */
179 GFT_PIE, /* Draw piechart */
180 GFT_HBAR /* Draw bar charts or histograms at our discretion. */
183 /* Parsed command. */
184 static struct cmd_frequencies cmd;
186 /* Summary of the barchart, histogram, and hbar subcommands. */
187 /* FIXME: These should not be mututally exclusive */
188 static int chart; /* NONE/BAR/HIST/HBAR/PIE. */
189 static double min, max; /* Minimum, maximum on y axis. */
190 static int format; /* FREQ/PERCENT: Scaling of y axis. */
191 static double scale, incr; /* FIXME */
192 static int normal; /* FIXME */
194 /* Variables for which to calculate statistics. */
195 static size_t n_variables;
196 static const struct variable **v_variables;
199 static struct pool *data_pool; /* For per-SPLIT FILE group data. */
200 static struct pool *syntax_pool; /* For syntax-related data. */
202 /* Frequency tables. */
204 /* Entire frequency table. */
207 struct hsh_table *data; /* Undifferentiated data. */
208 struct freq_mutable *valid; /* Valid freqs. */
209 int n_valid; /* Number of total freqs. */
211 struct freq_mutable *missing; /* Missing freqs. */
212 int n_missing; /* Number of missing freqs. */
215 double total_cases; /* Sum of weights of all cases. */
216 double valid_cases; /* Sum of weights of valid cases. */
220 /* Per-variable frequency data. */
223 /* Freqency table. */
224 struct freq_tab tab; /* Frequencies table to use. */
227 int n_groups; /* Number of groups. */
228 double *groups; /* Groups. */
231 double stat[frq_n_stats];
233 /* Variable attributes. */
235 struct fmt_spec print;
238 static inline struct var_freqs *
239 get_var_freqs (const struct variable *v)
241 return var_get_aux (v);
244 static void determine_charts (void);
246 static void calc_stats (const struct variable *v, double d[frq_n_stats]);
248 static void precalc (struct casereader *, struct dataset *);
249 static void calc (const struct ccase *, const struct dataset *);
250 static void postcalc (const struct dataset *);
252 static void postprocess_freq_tab (const struct variable *);
253 static void dump_full ( const struct variable *, const struct variable *);
254 static void dump_condensed (const struct variable *, const struct variable *);
255 static void dump_statistics (const struct variable *, bool show_varname, const struct variable *);
256 static void cleanup_freq_tab (const struct variable *);
258 static hsh_compare_func compare_value_numeric_a, compare_value_alpha_a;
259 static hsh_compare_func compare_value_numeric_d, compare_value_alpha_d;
260 static hsh_compare_func compare_freq_numeric_a, compare_freq_alpha_a;
261 static hsh_compare_func compare_freq_numeric_d, compare_freq_alpha_d;
264 static void do_piechart(const struct variable *var,
265 const struct freq_tab *frq_tab);
268 freq_tab_to_hist(const struct freq_tab *ft, const struct variable *var);
272 /* Parser and outline. */
274 static int internal_cmd_frequencies (struct lexer *lexer, struct dataset *ds);
277 cmd_frequencies (struct lexer *lexer, struct dataset *ds)
281 syntax_pool = pool_create ();
282 result = internal_cmd_frequencies (lexer, ds);
283 pool_destroy (syntax_pool);
285 pool_destroy (data_pool);
293 internal_cmd_frequencies (struct lexer *lexer, struct dataset *ds)
295 struct casegrouper *grouper;
296 struct casereader *input, *group;
306 if (!parse_frequencies (lexer, ds, &cmd, NULL))
309 if (cmd.onepage_limit == LONG_MIN)
310 cmd.onepage_limit = 50;
312 /* Figure out statistics to calculate. */
314 if (cmd.a_statistics[FRQ_ST_DEFAULT] || !cmd.sbc_statistics)
315 stats |= frq_default;
316 if (cmd.a_statistics[FRQ_ST_ALL])
318 if (cmd.sort != FRQ_AVALUE && cmd.sort != FRQ_DVALUE)
319 stats &= ~BIT_INDEX (frq_median);
320 for (i = 0; i < frq_n_stats; i++)
321 if (cmd.a_statistics[st_name[i].st_indx])
322 stats |= BIT_INDEX (i);
323 if (stats & frq_kurt)
324 stats |= BIT_INDEX (frq_sekurt);
325 if (stats & frq_skew)
326 stats |= BIT_INDEX (frq_seskew);
328 /* Calculate n_stats. */
330 for (i = 0; i < frq_n_stats; i++)
331 if ((stats & BIT_INDEX (i)))
336 if (chart != GFT_NONE || cmd.sbc_ntiles)
337 cmd.sort = FRQ_AVALUE;
339 /* Work out what percentiles need to be calculated */
340 if ( cmd.sbc_percentiles )
342 for ( i = 0 ; i < MAXLISTS ; ++i )
345 subc_list_double *ptl_list = &cmd.dl_percentiles[i];
346 for ( pl = 0 ; pl < subc_list_double_count(ptl_list); ++pl)
347 add_percentile (subc_list_double_at(ptl_list, pl) / 100.0 );
350 if ( cmd.sbc_ntiles )
352 for ( i = 0 ; i < cmd.sbc_ntiles ; ++i )
355 for (j = 0; j <= cmd.n_ntiles[i]; ++j )
356 add_percentile (j / (double) cmd.n_ntiles[i]);
359 if (stats & BIT_INDEX (frq_median))
361 /* Treat the median as the 50% percentile.
362 We output it in the percentiles table as "50 (Median)." */
363 add_percentile (0.5);
364 stats &= ~BIT_INDEX (frq_median);
369 input = casereader_create_filter_weight (proc_open (ds), dataset_dict (ds),
371 grouper = casegrouper_create_splits (input, dataset_dict (ds));
372 for (; casegrouper_get_next_group (grouper, &group);
373 casereader_destroy (group))
378 for (; (c = casereader_read (group)) != NULL; case_unref (c))
382 ok = casegrouper_destroy (grouper);
383 ok = proc_commit (ds) && ok;
385 free_frequencies(&cmd);
387 return ok ? CMD_SUCCESS : CMD_CASCADING_FAILURE;
390 /* Figure out which charts the user requested. */
392 determine_charts (void)
394 int count = (!!cmd.sbc_histogram) + (!!cmd.sbc_barchart) +
395 (!!cmd.sbc_hbar) + (!!cmd.sbc_piechart);
405 msg (SW, _("At most one of BARCHART, HISTOGRAM, or HBAR should be "
406 "given. HBAR will be assumed. Argument values will be "
407 "given precedence increasing along the order given."));
409 else if (cmd.sbc_histogram)
411 else if (cmd.sbc_barchart)
413 else if (cmd.sbc_piechart)
424 if (cmd.sbc_barchart)
426 if (cmd.ba_min != SYSMIS)
428 if (cmd.ba_max != SYSMIS)
430 if (cmd.ba_scale == FRQ_FREQ)
435 else if (cmd.ba_scale == FRQ_PERCENT)
437 format = FRQ_PERCENT;
442 if (cmd.sbc_histogram)
444 if (cmd.hi_min != SYSMIS)
446 if (cmd.hi_max != SYSMIS)
448 if (cmd.hi_scale == FRQ_FREQ)
453 else if (cmd.hi_scale == FRQ_PERCENT)
455 format = FRQ_PERCENT;
458 if (cmd.hi_norm != FRQ_NONORMAL )
460 if (cmd.hi_incr == FRQ_INCREMENT)
466 if (cmd.hb_min != SYSMIS)
468 if (cmd.hb_max != SYSMIS)
470 if (cmd.hb_scale == FRQ_FREQ)
475 else if (cmd.hb_scale == FRQ_PERCENT)
477 format = FRQ_PERCENT;
482 if (cmd.hb_incr == FRQ_INCREMENT)
486 if (min != SYSMIS && max != SYSMIS && min >= max)
488 msg (SE, _("MAX must be greater than or equal to MIN, if both are "
489 "specified. However, MIN was specified as %g and MAX as %g. "
490 "MIN and MAX will be ignored."), min, max);
495 /* Add data from case C to the frequency table. */
497 calc (const struct ccase *c, const struct dataset *ds)
499 double weight = dict_get_case_weight (dataset_dict (ds), c, NULL);
502 for (i = 0; i < n_variables; i++)
504 const struct variable *v = v_variables[i];
505 const union value *val = case_data (c, v);
506 struct var_freqs *vf = get_var_freqs (v);
507 struct freq_tab *ft = &vf->tab;
509 struct freq_mutable target;
510 struct freq_mutable **fpp;
513 fpp = (struct freq_mutable **) hsh_probe (ft->data, &target);
516 (*fpp)->count += weight;
519 struct freq_mutable *fp = pool_alloc (data_pool, sizeof *fp);
521 value_init_pool (data_pool, &fp->value, vf->width);
522 value_copy (&fp->value, val, vf->width);
528 /* Prepares each variable that is the target of FREQUENCIES by setting
529 up its hash table. */
531 precalc (struct casereader *input, struct dataset *ds)
536 c = casereader_peek (input, 0);
539 output_split_file_values (ds, c);
543 pool_destroy (data_pool);
544 data_pool = pool_create ();
546 for (i = 0; i < n_variables; i++)
548 const struct variable *v = v_variables[i];
549 struct freq_tab *ft = &get_var_freqs (v)->tab;
551 ft->data = hsh_create (16, compare_freq, hash_freq, NULL, v);
555 /* Finishes up with the variables after frequencies have been
556 calculated. Displays statistics, percentiles, ... */
558 postcalc (const struct dataset *ds)
560 const struct dictionary *dict = dataset_dict (ds);
561 const struct variable *wv = dict_get_weight (dict);
564 for (i = 0; i < n_variables; i++)
566 const struct variable *v = v_variables[i];
567 struct var_freqs *vf = get_var_freqs (v);
568 struct freq_tab *ft = &vf->tab;
570 int dumped_freq_tab = 1;
572 postprocess_freq_tab (v);
574 /* Frequencies tables. */
575 n_categories = ft->n_valid + ft->n_missing;
576 if (cmd.table == FRQ_TABLE
577 || (cmd.table == FRQ_LIMIT && n_categories <= cmd.limit))
581 dump_condensed (v, wv);
587 if (n_categories > cmd.onepage_limit)
588 dump_condensed (v, wv);
600 dump_statistics (v, !dumped_freq_tab, wv);
604 if ( chart == GFT_HIST && var_is_numeric (v) )
606 double d[frq_n_stats];
607 struct histogram *hist ;
611 hist = freq_tab_to_hist (ft,v);
613 chart_submit (histogram_chart_create (
614 hist, var_to_string(v),
620 statistic_destroy (&hist->parent);
623 if ( chart == GFT_PIE)
625 do_piechart(v_variables[i], ft);
628 cleanup_freq_tab (v);
633 /* Returns the comparison function that should be used for
634 sorting a frequency table by FRQ_SORT using VAL_TYPE
636 static hsh_compare_func *
637 get_freq_comparator (int frq_sort, enum val_type val_type)
639 bool is_numeric = val_type == VAL_NUMERIC;
643 return is_numeric ? compare_value_numeric_a : compare_value_alpha_a;
645 return is_numeric ? compare_value_numeric_d : compare_value_alpha_d;
647 return is_numeric ? compare_freq_numeric_a : compare_freq_alpha_a;
649 return is_numeric ? compare_freq_numeric_d : compare_freq_alpha_d;
655 /* Returns true iff the value in struct freq_mutable F is non-missing
658 not_missing (const void *f_, const void *v_)
660 const struct freq_mutable *f = f_;
661 const struct variable *v = v_;
663 return !var_is_value_missing (v, &f->value, MV_ANY);
666 /* Summarizes the frequency table data for variable V. */
668 postprocess_freq_tab (const struct variable *v)
670 hsh_compare_func *compare;
674 struct freq_mutable *freqs, *f;
677 ft = &get_var_freqs (v)->tab;
678 compare = get_freq_comparator (cmd.sort, var_get_type (v));
680 /* Extract data from hash table. */
681 count = hsh_count (ft->data);
682 data = hsh_data (ft->data);
684 /* Copy dereferenced data into freqs. */
685 freqs = xnmalloc (count, sizeof *freqs);
686 for (i = 0; i < count; i++)
688 struct freq_mutable *f = data[i];
692 /* Put data into ft. */
694 ft->n_valid = partition (freqs, count, sizeof *freqs, not_missing, v);
695 ft->missing = freqs + ft->n_valid;
696 ft->n_missing = count - ft->n_valid;
699 sort (ft->valid, ft->n_valid, sizeof *ft->valid, compare, v);
700 sort (ft->missing, ft->n_missing, sizeof *ft->missing, compare, v);
702 /* Summary statistics. */
703 ft->valid_cases = 0.0;
704 for(i = 0 ; i < ft->n_valid ; ++i )
707 ft->valid_cases += f->count;
711 ft->total_cases = ft->valid_cases ;
712 for(i = 0 ; i < ft->n_missing ; ++i )
715 ft->total_cases += f->count;
720 /* Frees the frequency table for variable V. */
722 cleanup_freq_tab (const struct variable *v)
724 struct freq_tab *ft = &get_var_freqs (v)->tab;
726 hsh_destroy (ft->data);
729 /* Parses the VARIABLES subcommand, adding to
730 {n_variables,v_variables}. */
732 frq_custom_variables (struct lexer *lexer, struct dataset *ds, struct cmd_frequencies *cmd UNUSED, void *aux UNUSED)
734 size_t old_n_variables = n_variables;
737 lex_match (lexer, '=');
738 if (lex_token (lexer) != T_ALL && (lex_token (lexer) != T_ID
739 || dict_lookup_var (dataset_dict (ds), lex_tokid (lexer)) == NULL))
742 if (!parse_variables_const (lexer, dataset_dict (ds), &v_variables, &n_variables,
743 PV_APPEND | PV_NO_SCRATCH))
746 for (i = old_n_variables; i < n_variables; i++)
748 const struct variable *v = v_variables[i];
749 struct var_freqs *vf;
751 if (var_get_aux (v) != NULL)
753 msg (SE, _("Variable %s specified multiple times on VARIABLES "
754 "subcommand."), var_get_name (v));
757 vf = var_attach_aux (v, xmalloc (sizeof *vf), var_dtor_free);
758 vf->tab.valid = vf->tab.missing = NULL;
761 vf->width = var_get_width (v);
762 vf->print = *var_get_print_format (v);
767 /* Parses the GROUPED subcommand, setting the n_grouped, grouped
768 fields of specified variables. */
770 frq_custom_grouped (struct lexer *lexer, struct dataset *ds, struct cmd_frequencies *cmd UNUSED, void *aux UNUSED)
772 lex_match (lexer, '=');
773 if ((lex_token (lexer) == T_ID && dict_lookup_var (dataset_dict (ds), lex_tokid (lexer)) != NULL)
774 || lex_token (lexer) == T_ID)
779 /* Max, current size of list; list itself. */
785 const struct variable **v;
787 if (!parse_variables_const (lexer, dataset_dict (ds), &v, &n,
788 PV_NO_DUPLICATE | PV_NUMERIC))
790 if (lex_match (lexer, '('))
794 while (lex_integer (lexer))
799 dl = pool_nrealloc (syntax_pool, dl, ml, sizeof *dl);
801 dl[nl++] = lex_tokval (lexer);
803 lex_match (lexer, ',');
805 /* Note that nl might still be 0 and dl might still be
806 NULL. That's okay. */
807 if (!lex_match (lexer, ')'))
810 msg (SE, _("`)' expected after GROUPED interval list."));
820 for (i = 0; i < n; i++)
821 if (var_get_aux (v[i]) == NULL)
822 msg (SE, _("Variables %s specified on GROUPED but not on "
823 "VARIABLES."), var_get_name (v[i]));
826 struct var_freqs *vf = get_var_freqs (v[i]);
828 if (vf->groups != NULL)
829 msg (SE, _("Variables %s specified multiple times on GROUPED "
830 "subcommand."), var_get_name (v[i]));
838 if (!lex_match (lexer, '/'))
840 if ((lex_token (lexer) != T_ID || dict_lookup_var (dataset_dict (ds), lex_tokid (lexer)) != NULL)
841 && lex_token (lexer) != T_ALL)
843 lex_put_back (lexer, '/');
851 /* Adds X to the list of percentiles, keeping the list in proper
854 add_percentile (double x)
858 for (i = 0; i < n_percentiles; i++)
860 /* Do nothing if it's already in the list */
861 if ( fabs(x - percentiles[i].p) < DBL_EPSILON )
864 if (x < percentiles[i].p)
868 if (i >= n_percentiles || x != percentiles[i].p)
870 percentiles = pool_nrealloc (syntax_pool, percentiles,
871 n_percentiles + 1, sizeof *percentiles);
872 insert_element (percentiles, n_percentiles, sizeof *percentiles, i);
873 percentiles[i].p = x;
878 /* Comparison functions. */
880 /* Ascending numeric compare of values. */
882 compare_value_numeric_a (const void *a_, const void *b_, const void *aux UNUSED)
884 const struct freq_mutable *a = a_;
885 const struct freq_mutable *b = b_;
887 if (a->value.f > b->value.f)
889 else if (a->value.f < b->value.f)
895 /* Ascending string compare of values. */
897 compare_value_alpha_a (const void *a_, const void *b_, const void *v_)
899 const struct freq_mutable *a = a_;
900 const struct freq_mutable *b = b_;
901 const struct variable *v = v_;
902 struct var_freqs *vf = get_var_freqs (v);
904 return value_compare_3way (&a->value, &b->value, vf->width);
907 /* Descending numeric compare of values. */
909 compare_value_numeric_d (const void *a, const void *b, const void *aux UNUSED)
911 return -compare_value_numeric_a (a, b, aux);
914 /* Descending string compare of values. */
916 compare_value_alpha_d (const void *a, const void *b, const void *v)
918 return -compare_value_alpha_a (a, b, v);
921 /* Ascending numeric compare of frequency;
922 secondary key on ascending numeric value. */
924 compare_freq_numeric_a (const void *a_, const void *b_, const void *aux UNUSED)
926 const struct freq_mutable *a = a_;
927 const struct freq_mutable *b = b_;
929 if (a->count > b->count)
931 else if (a->count < b->count)
934 if (a->value.f > b->value.f)
936 else if (a->value.f < b->value.f)
942 /* Ascending numeric compare of frequency;
943 secondary key on ascending string value. */
945 compare_freq_alpha_a (const void *a_, const void *b_, const void *v_)
947 const struct freq_mutable *a = a_;
948 const struct freq_mutable *b = b_;
949 const struct variable *v = v_;
950 struct var_freqs *vf = get_var_freqs (v);
952 if (a->count > b->count)
954 else if (a->count < b->count)
957 return value_compare_3way (&a->value, &b->value, vf->width);
960 /* Descending numeric compare of frequency;
961 secondary key on ascending numeric value. */
963 compare_freq_numeric_d (const void *a_, const void *b_, const void *aux UNUSED)
965 const struct freq_mutable *a = a_;
966 const struct freq_mutable *b = b_;
968 if (a->count > b->count)
970 else if (a->count < b->count)
973 if (a->value.f > b->value.f)
975 else if (a->value.f < b->value.f)
981 /* Descending numeric compare of frequency;
982 secondary key on ascending string value. */
984 compare_freq_alpha_d (const void *a_, const void *b_, const void *v_)
986 const struct freq_mutable *a = a_;
987 const struct freq_mutable *b = b_;
988 const struct variable *v = v_;
989 struct var_freqs *vf = get_var_freqs (v);
991 if (a->count > b->count)
993 else if (a->count < b->count)
996 return value_compare_3way (&a->value, &b->value, vf->width);
999 /* Frequency table display. */
1006 /* Sets the widths of all the columns and heights of all the rows in
1007 table T for driver D. */
1009 full_dim (struct tab_rendering *r, void *aux_)
1011 const struct outp_driver *d = r->driver;
1012 const struct tab_table *t = r->table;
1013 const struct full_dim_aux *aux = aux_;
1016 for (i = 0; i < tab_nc (t); i++)
1018 r->w[i] = tab_natural_width (r, i);
1019 if (aux->show_labels && i == 0)
1020 r->w[i] = MIN (r->w[i], d->prop_em_width * 15);
1022 r->w[i] = MAX (r->w[i], d->prop_em_width * 8);
1025 for (i = 0; i < tab_nr (t); i++)
1026 r->h[i] = d->font_height;
1030 full_dim_free (void *aux_)
1032 struct full_dim_aux *aux = aux_;
1036 /* Displays a full frequency table for variable V. */
1038 dump_full (const struct variable *v, const struct variable *wv)
1040 const struct fmt_spec *wfmt = wv ? var_get_print_format (wv) : &F_8_0;
1042 struct var_freqs *vf;
1043 struct freq_tab *ft;
1044 struct freq_mutable *f;
1045 struct tab_table *t;
1047 double cum_total = 0.0;
1048 double cum_freq = 0.0;
1056 const struct init *p;
1058 static const struct init vec[] =
1060 {4, 0, N_("Valid")},
1062 {1, 1, N_("Value")},
1063 {2, 1, N_("Frequency")},
1064 {3, 1, N_("Percent")},
1065 {4, 1, N_("Percent")},
1066 {5, 1, N_("Percent")},
1074 const bool lab = (cmd.labels == FRQ_LABELS);
1076 struct full_dim_aux *aux;
1078 vf = get_var_freqs (v);
1080 n_categories = ft->n_valid + ft->n_missing;
1081 t = tab_create (5 + lab, n_categories + 3, 0);
1082 tab_headers (t, 0, 0, 2, 0);
1084 aux = xmalloc (sizeof *aux);
1085 aux->show_labels = lab;
1086 tab_dim (t, full_dim, full_dim_free, aux);
1089 tab_text (t, 0, 1, TAB_CENTER | TAT_TITLE, _("Value Label"));
1091 for (p = vec; p->s; p++)
1092 tab_text (t, lab ? p->c : p->c - 1, p->r,
1093 TAB_CENTER | TAT_TITLE, gettext (p->s));
1096 for (f = ft->valid; f < ft->missing; f++)
1098 double percent, valid_percent;
1100 cum_freq += f->count;
1102 percent = f->count / ft->total_cases * 100.0;
1103 valid_percent = f->count / ft->valid_cases * 100.0;
1104 cum_total += valid_percent;
1108 const char *label = var_lookup_value_label (v, &f->value);
1110 tab_text (t, 0, r, TAB_LEFT, label);
1113 tab_value (t, 0 + lab, r, TAB_NONE, &f->value, &vf->print);
1114 tab_double (t, 1 + lab, r, TAB_NONE, f->count, wfmt);
1115 tab_double (t, 2 + lab, r, TAB_NONE, percent, NULL);
1116 tab_double (t, 3 + lab, r, TAB_NONE, valid_percent, NULL);
1117 tab_double (t, 4 + lab, r, TAB_NONE, cum_total, NULL);
1120 for (; f < &ft->valid[n_categories]; f++)
1122 cum_freq += f->count;
1126 const char *label = var_lookup_value_label (v, &f->value);
1128 tab_text (t, 0, r, TAB_LEFT, label);
1131 tab_value (t, 0 + lab, r, TAB_NONE, &f->value, &vf->print);
1132 tab_double (t, 1 + lab, r, TAB_NONE, f->count, wfmt);
1133 tab_double (t, 2 + lab, r, TAB_NONE,
1134 f->count / ft->total_cases * 100.0, NULL);
1135 tab_text (t, 3 + lab, r, TAB_NONE, _("Missing"));
1139 tab_box (t, TAL_1, TAL_1,
1140 cmd.spaces == FRQ_SINGLE ? -1 : TAL_GAP, TAL_1,
1142 tab_hline (t, TAL_2, 0, 4 + lab, 2);
1143 tab_hline (t, TAL_2, 0, 4 + lab, r);
1144 tab_joint_text (t, 0, r, 0 + lab, r, TAB_RIGHT | TAT_TITLE, _("Total"));
1145 tab_vline (t, TAL_0, 1, r, r);
1146 tab_double (t, 1 + lab, r, TAB_NONE, cum_freq, wfmt);
1147 tab_fixed (t, 2 + lab, r, TAB_NONE, 100.0, 5, 1);
1148 tab_fixed (t, 3 + lab, r, TAB_NONE, 100.0, 5, 1);
1150 tab_title (t, "%s", var_to_string (v));
1154 /* Sets the widths of all the columns and heights of all the rows in
1155 table T for driver D. */
1157 condensed_dim (struct tab_rendering *r, void *aux UNUSED)
1159 struct outp_driver *d = r->driver;
1160 const struct tab_table *t = r->table;
1162 int cum_width = outp_string_width (d, _("Cum"), OUTP_PROPORTIONAL);
1163 int zeros_width = outp_string_width (d, "000", OUTP_PROPORTIONAL);
1164 int max_width = MAX (cum_width, zeros_width);
1168 for (i = 0; i < 2; i++)
1170 r->w[i] = tab_natural_width (r, i);
1171 r->w[i] = MAX (r->w[i], d->prop_em_width * 8);
1173 for (i = 2; i < 4; i++)
1174 r->w[i] = max_width;
1175 for (i = 0; i < tab_nr (t); i++)
1176 r->h[i] = d->font_height;
1179 /* Display condensed frequency table for variable V. */
1181 dump_condensed (const struct variable *v, const struct variable *wv)
1183 const struct fmt_spec *wfmt = wv ? var_get_print_format (wv) : &F_8_0;
1185 struct var_freqs *vf;
1186 struct freq_tab *ft;
1187 struct freq_mutable *f;
1188 struct tab_table *t;
1190 double cum_total = 0.0;
1192 vf = get_var_freqs (v);
1194 n_categories = ft->n_valid + ft->n_missing;
1195 t = tab_create (4, n_categories + 2, 0);
1197 tab_headers (t, 0, 0, 2, 0);
1198 tab_text (t, 0, 1, TAB_CENTER | TAT_TITLE, _("Value"));
1199 tab_text (t, 1, 1, TAB_CENTER | TAT_TITLE, _("Freq"));
1200 tab_text (t, 2, 1, TAB_CENTER | TAT_TITLE, _("Pct"));
1201 tab_text (t, 3, 0, TAB_CENTER | TAT_TITLE, _("Cum"));
1202 tab_text (t, 3, 1, TAB_CENTER | TAT_TITLE, _("Pct"));
1203 tab_dim (t, condensed_dim, NULL, NULL);
1206 for (f = ft->valid; f < ft->missing; f++)
1210 percent = f->count / ft->total_cases * 100.0;
1211 cum_total += f->count / ft->valid_cases * 100.0;
1213 tab_value (t, 0, r, TAB_NONE, &f->value, &vf->print);
1214 tab_double (t, 1, r, TAB_NONE, f->count, wfmt);
1215 tab_double (t, 2, r, TAB_NONE, percent, NULL);
1216 tab_double (t, 3, r, TAB_NONE, cum_total, NULL);
1219 for (; f < &ft->valid[n_categories]; f++)
1221 tab_value (t, 0, r, TAB_NONE, &f->value, &vf->print);
1222 tab_double (t, 1, r, TAB_NONE, f->count, wfmt);
1223 tab_double (t, 2, r, TAB_NONE,
1224 f->count / ft->total_cases * 100.0, NULL);
1228 tab_box (t, TAL_1, TAL_1,
1229 cmd.spaces == FRQ_SINGLE ? -1 : TAL_GAP, TAL_1,
1231 tab_hline (t, TAL_2, 0, 3, 2);
1232 tab_title (t, "%s", var_to_string (v));
1233 tab_columns (t, SOM_COL_DOWN);
1237 /* Statistical display. */
1239 /* Calculates all the pertinent statistics for variable V, putting
1240 them in array D[]. FIXME: This could be made much more optimal. */
1242 calc_stats (const struct variable *v, double d[frq_n_stats])
1244 struct freq_tab *ft = &get_var_freqs (v)->tab;
1245 double W = ft->valid_cases;
1247 struct freq_mutable *f=0;
1255 /* Calculate percentiles. */
1257 for (i = 0; i < n_percentiles; i++)
1259 percentiles[i].flag = 0;
1260 percentiles[i].flag2 = 0;
1264 for (idx = 0; idx < ft->n_valid; ++idx)
1266 static double prev_value = SYSMIS;
1267 f = &ft->valid[idx];
1269 for (i = 0; i < n_percentiles; i++)
1272 if ( percentiles[i].flag2 ) continue ;
1274 if ( settings_get_algorithm () != COMPATIBLE )
1276 (ft->valid_cases - 1) * percentiles[i].p;
1279 (ft->valid_cases + 1) * percentiles[i].p - 1;
1281 if ( percentiles[i].flag )
1283 percentiles[i].x2 = f->value.f;
1284 percentiles[i].x1 = prev_value;
1285 percentiles[i].flag2 = 1;
1291 if ( f->count > 1 && rank - (f->count - 1) > tp )
1293 percentiles[i].x2 = percentiles[i].x1 = f->value.f;
1294 percentiles[i].flag2 = 1;
1298 percentiles[i].flag=1;
1304 prev_value = f->value.f;
1307 for (i = 0; i < n_percentiles; i++)
1309 /* Catches the case when p == 100% */
1310 if ( ! percentiles[i].flag2 )
1311 percentiles[i].x1 = percentiles[i].x2 = f->value.f;
1314 printf("percentile %d (p==%.2f); X1 = %g; X2 = %g\n",
1315 i,percentiles[i].p,percentiles[i].x1,percentiles[i].x2);
1319 for (i = 0; i < n_percentiles; i++)
1321 struct freq_tab *ft = &get_var_freqs (v)->tab;
1325 if ( settings_get_algorithm () != COMPATIBLE )
1327 s = modf((ft->valid_cases - 1) * percentiles[i].p , &dummy);
1331 s = modf((ft->valid_cases + 1) * percentiles[i].p -1, &dummy);
1334 percentiles[i].value = percentiles[i].x1 +
1335 ( percentiles[i].x2 - percentiles[i].x1) * s ;
1339 /* Calculate the mode. */
1342 for (f = ft->valid; f < ft->missing; f++)
1344 if (most_often < f->count)
1346 most_often = f->count;
1347 X_mode = f->value.f;
1349 else if (most_often == f->count)
1351 /* A duplicate mode is undefined.
1352 FIXME: keep track of *all* the modes. */
1357 /* Calculate moments. */
1358 m = moments_create (MOMENT_KURTOSIS);
1359 for (f = ft->valid; f < ft->missing; f++)
1360 moments_pass_one (m, f->value.f, f->count);
1361 for (f = ft->valid; f < ft->missing; f++)
1362 moments_pass_two (m, f->value.f, f->count);
1363 moments_calculate (m, NULL, &d[frq_mean], &d[frq_variance],
1364 &d[frq_skew], &d[frq_kurt]);
1365 moments_destroy (m);
1367 /* Formulas below are taken from _SPSS Statistical Algorithms_. */
1368 d[frq_min] = ft->valid[0].value.f;
1369 d[frq_max] = ft->valid[ft->n_valid - 1].value.f;
1370 d[frq_mode] = X_mode;
1371 d[frq_range] = d[frq_max] - d[frq_min];
1372 d[frq_sum] = d[frq_mean] * W;
1373 d[frq_stddev] = sqrt (d[frq_variance]);
1374 d[frq_semean] = d[frq_stddev] / sqrt (W);
1375 d[frq_seskew] = calc_seskew (W);
1376 d[frq_sekurt] = calc_sekurt (W);
1379 /* Displays a table of all the statistics requested for variable V. */
1381 dump_statistics (const struct variable *v, bool show_varname,
1382 const struct variable *wv)
1384 const struct fmt_spec *wfmt = wv ? var_get_print_format (wv) : &F_8_0;
1385 struct freq_tab *ft;
1386 double stat_value[frq_n_stats];
1387 struct tab_table *t;
1390 if (var_is_alpha (v))
1392 ft = &get_var_freqs (v)->tab;
1393 if (ft->n_valid == 0)
1395 msg (SW, _("No valid data for variable %s; statistics not displayed."),
1399 calc_stats (v, stat_value);
1401 t = tab_create (3, n_stats + n_percentiles + 2, 0);
1402 tab_dim (t, tab_natural_dimensions, NULL, NULL);
1404 tab_box (t, TAL_1, TAL_1, -1, -1 , 0 , 0 , 2, tab_nr(t) - 1) ;
1407 tab_vline (t, TAL_1 , 2, 0, tab_nr(t) - 1);
1408 tab_vline (t, TAL_GAP , 1, 0, tab_nr(t) - 1 ) ;
1410 r=2; /* N missing and N valid are always dumped */
1412 for (i = 0; i < frq_n_stats; i++)
1413 if (stats & BIT_INDEX (i))
1415 tab_text (t, 0, r, TAB_LEFT | TAT_TITLE,
1416 gettext (st_name[i].s10));
1417 tab_double (t, 2, r, TAB_NONE, stat_value[i], NULL);
1421 tab_text (t, 0, 0, TAB_LEFT | TAT_TITLE, _("N"));
1422 tab_text (t, 1, 0, TAB_LEFT | TAT_TITLE, _("Valid"));
1423 tab_text (t, 1, 1, TAB_LEFT | TAT_TITLE, _("Missing"));
1425 tab_double (t, 2, 0, TAB_NONE, ft->valid_cases, wfmt);
1426 tab_double (t, 2, 1, TAB_NONE, ft->total_cases - ft->valid_cases, wfmt);
1428 for (i = 0; i < n_percentiles; i++, r++)
1432 tab_text (t, 0, r, TAB_LEFT | TAT_TITLE, _("Percentiles"));
1435 if (percentiles[i].p == 0.5)
1436 tab_text (t, 1, r, TAB_LEFT, _("50 (Median)"));
1438 tab_fixed (t, 1, r, TAB_LEFT, percentiles[i].p * 100, 3, 0);
1439 tab_double (t, 2, r, TAB_NONE, percentiles[i].value,
1440 var_get_print_format (v));
1443 tab_columns (t, SOM_COL_DOWN);
1445 tab_title (t, "%s", var_to_string (v));
1447 tab_flags (t, SOMF_NO_TITLE);
1454 /* Create a gsl_histogram from a freq_tab */
1456 freq_tab_to_hist (const struct freq_tab *ft, const struct variable *var)
1459 double x_min = DBL_MAX;
1460 double x_max = -DBL_MAX;
1462 struct histogram *hist;
1463 const double bins = 11;
1465 struct hsh_iterator hi;
1466 struct hsh_table *fh = ft->data;
1467 struct freq_mutable *frq;
1469 /* Find out the extremes of the x value */
1470 for ( frq = hsh_first(fh, &hi); frq != 0; frq = hsh_next(fh, &hi) )
1472 if (var_is_value_missing(var, &frq->value, MV_ANY))
1475 if ( frq->value.f < x_min ) x_min = frq->value.f ;
1476 if ( frq->value.f > x_max ) x_max = frq->value.f ;
1479 hist = histogram_create (bins, x_min, x_max);
1481 for( i = 0 ; i < ft->n_valid ; ++i )
1483 frq = &ft->valid[i];
1484 histogram_add (hist, frq->value.f, frq->count);
1491 static struct slice *
1492 freq_tab_to_slice_array(const struct freq_tab *frq_tab,
1493 const struct variable *var,
1497 /* Allocate an array of slices and fill them from the data in frq_tab
1498 n_slices will contain the number of slices allocated.
1499 The caller is responsible for freeing slices
1501 static struct slice *
1502 freq_tab_to_slice_array(const struct freq_tab *frq_tab,
1503 const struct variable *var,
1507 struct slice *slices;
1509 *n_slices = frq_tab->n_valid;
1511 slices = xnmalloc (*n_slices, sizeof *slices);
1513 for (i = 0 ; i < *n_slices ; ++i )
1515 const struct freq_mutable *frq = &frq_tab->valid[i];
1517 ds_init_empty (&slices[i].label);
1518 var_append_value_name (var, &frq->value, &slices[i].label);
1519 slices[i].magnitude = frq->count;
1529 do_piechart(const struct variable *var, const struct freq_tab *frq_tab)
1531 struct slice *slices;
1534 slices = freq_tab_to_slice_array(frq_tab, var, &n_slices);
1536 chart_submit (piechart_create (var_to_string(var), slices, n_slices));
1538 for (i = 0 ; i < n_slices ; ++i )
1539 ds_destroy (&slices[i].label);