1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 1997-9, 2000, 2006, 2009, 2010 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/>. */
19 - Pearson's R (but not Spearman!) is off a little.
20 - T values for Spearman's R and Pearson's R are wrong.
21 - How to calculate significance of symmetric and directional measures?
22 - Asymmetric ASEs and T values for lambda are wrong.
23 - ASE of Goodman and Kruskal's tau is not calculated.
24 - ASE of symmetric somers' d is wrong.
25 - Approx. T of uncertainty coefficient is wrong.
32 #include <gsl/gsl_cdf.h>
36 #include <data/case.h>
37 #include <data/casegrouper.h>
38 #include <data/casereader.h>
39 #include <data/data-out.h>
40 #include <data/dictionary.h>
41 #include <data/format.h>
42 #include <data/procedure.h>
43 #include <data/value-labels.h>
44 #include <data/variable.h>
45 #include <language/command.h>
46 #include <language/dictionary/split-file.h>
47 #include <language/lexer/lexer.h>
48 #include <language/lexer/variable-parser.h>
49 #include <libpspp/array.h>
50 #include <libpspp/assertion.h>
51 #include <libpspp/compiler.h>
52 #include <libpspp/hash.h>
53 #include <libpspp/hmap.h>
54 #include <libpspp/hmapx.h>
55 #include <libpspp/message.h>
56 #include <libpspp/misc.h>
57 #include <libpspp/pool.h>
58 #include <libpspp/str.h>
59 #include <output/tab.h>
66 #define _(msgid) gettext (msgid)
67 #define N_(msgid) msgid
75 missing=miss:!table/include/report;
76 +write[wr_]=none,cells,all;
77 +format=fmt:!labels/nolabels/novallabs,
80 tabl:!tables/notables,
83 +cells[cl_]=count,expected,row,column,total,residual,sresidual,
85 +statistics[st_]=chisq,phi,cc,lambda,uc,none,btau,ctau,risk,gamma,d,
91 /* Number of chi-square statistics. */
94 /* Number of symmetric statistics. */
97 /* Number of directional statistics. */
98 #define N_DIRECTIONAL 13
100 /* A single table entry for general mode. */
103 struct hmap_node node; /* Entry in hash table. */
104 double freq; /* Frequency count. */
105 union value values[1]; /* Values. */
109 table_entry_size (size_t n_values)
111 return (offsetof (struct table_entry, values)
112 + n_values * sizeof (union value));
115 /* Indexes into the 'vars' member of struct pivot_table and
116 struct crosstab member. */
119 ROW_VAR = 0, /* Row variable. */
120 COL_VAR = 1 /* Column variable. */
121 /* Higher indexes cause multiple tables to be output. */
124 /* A crosstabulation of 2 or more variables. */
127 struct fmt_spec weight_format; /* Format for weight variable. */
128 double missing; /* Weight of missing cases. */
130 /* Variables (2 or more). */
132 const struct variable **vars;
134 /* Constants (0 or more). */
136 const struct variable **const_vars;
137 union value *const_values;
141 struct table_entry **entries;
144 /* Column values, number of columns. */
148 /* Row values, number of rows. */
152 /* Number of statistically interesting columns/rows
153 (columns/rows with data in them). */
154 int ns_cols, ns_rows;
156 /* Matrix contents. */
157 double *mat; /* Matrix proper. */
158 double *row_tot; /* Row totals. */
159 double *col_tot; /* Column totals. */
160 double total; /* Grand total. */
163 /* Integer mode variable info. */
166 int min; /* Minimum value. */
167 int max; /* Maximum value + 1. */
168 int count; /* max - min. */
171 static inline struct var_range *
172 get_var_range (const struct variable *v)
174 return var_get_aux (v);
177 struct crosstabs_proc
179 const struct dictionary *dict;
180 enum { INTEGER, GENERAL } mode;
181 enum mv_class exclude;
184 struct fmt_spec weight_format;
186 /* Variables specifies on VARIABLES. */
187 const struct variable **variables;
191 struct pivot_table *pivots;
195 int n_cells; /* Number of cells requested. */
196 unsigned int cells; /* Bit k is 1 if cell k is requested. */
197 int a_cells[CRS_CL_count]; /* 0...n_cells-1 are the requested cells. */
200 unsigned int statistics; /* Bit k is 1 if statistic k is requested. */
204 init_proc (struct crosstabs_proc *proc, struct dataset *ds)
206 const struct variable *wv = dict_get_weight (dataset_dict (ds));
207 proc->dict = dataset_dict (ds);
208 proc->bad_warn = true;
209 proc->variables = NULL;
210 proc->n_variables = 0;
213 proc->weight_format = wv ? *var_get_print_format (wv) : F_8_0;
217 free_proc (struct crosstabs_proc *proc)
219 struct pivot_table *pt;
221 free (proc->variables);
222 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
225 free (pt->const_vars);
226 /* We must not call value_destroy on const_values because
227 it is a wild pointer; it never pointed to anything owned
230 The rest of the data was allocated and destroyed at a
231 lower level already. */
236 static int internal_cmd_crosstabs (struct lexer *lexer, struct dataset *ds,
237 struct crosstabs_proc *);
238 static bool should_tabulate_case (const struct pivot_table *,
239 const struct ccase *, enum mv_class exclude);
240 static void tabulate_general_case (struct pivot_table *, const struct ccase *,
242 static void tabulate_integer_case (struct pivot_table *, const struct ccase *,
244 static void postcalc (struct crosstabs_proc *);
245 static void submit (struct pivot_table *, struct tab_table *);
247 /* Parse and execute CROSSTABS, then clean up. */
249 cmd_crosstabs (struct lexer *lexer, struct dataset *ds)
251 struct crosstabs_proc proc;
254 init_proc (&proc, ds);
255 result = internal_cmd_crosstabs (lexer, ds, &proc);
261 /* Parses and executes the CROSSTABS procedure. */
263 internal_cmd_crosstabs (struct lexer *lexer, struct dataset *ds,
264 struct crosstabs_proc *proc)
266 struct casegrouper *grouper;
267 struct casereader *input, *group;
268 struct cmd_crosstabs cmd;
269 struct pivot_table *pt;
273 if (!parse_crosstabs (lexer, ds, &cmd, proc))
276 proc->mode = proc->n_variables ? INTEGER : GENERAL;
280 proc->cells = 1u << CRS_CL_COUNT;
281 else if (cmd.a_cells[CRS_CL_ALL])
282 proc->cells = UINT_MAX;
286 for (i = 0; i < CRS_CL_count; i++)
288 proc->cells |= 1u << i;
289 if (proc->cells == 0)
290 proc->cells = ((1u << CRS_CL_COUNT)
292 | (1u << CRS_CL_COLUMN)
293 | (1u << CRS_CL_TOTAL));
295 proc->cells &= ((1u << CRS_CL_count) - 1);
296 proc->cells &= ~((1u << CRS_CL_NONE) | (1u << CRS_CL_ALL));
298 for (i = 0; i < CRS_CL_count; i++)
299 if (proc->cells & (1u << i))
300 proc->a_cells[proc->n_cells++] = i;
303 if (cmd.a_statistics[CRS_ST_ALL])
304 proc->statistics = UINT_MAX;
305 else if (cmd.sbc_statistics)
309 proc->statistics = 0;
310 for (i = 0; i < CRS_ST_count; i++)
311 if (cmd.a_statistics[i])
312 proc->statistics |= 1u << i;
313 if (proc->statistics == 0)
314 proc->statistics |= 1u << CRS_ST_CHISQ;
317 proc->statistics = 0;
320 proc->exclude = (cmd.miss == CRS_TABLE ? MV_ANY
321 : cmd.miss == CRS_INCLUDE ? MV_SYSTEM
323 if (proc->mode == GENERAL && proc->mode == MV_NEVER)
325 msg (SE, _("Missing mode REPORT not allowed in general mode. "
326 "Assuming MISSING=TABLE."));
331 proc->pivot = cmd.pivot == CRS_PIVOT;
333 input = casereader_create_filter_weight (proc_open (ds), dataset_dict (ds),
335 grouper = casegrouper_create_splits (input, dataset_dict (ds));
336 while (casegrouper_get_next_group (grouper, &group))
340 /* Output SPLIT FILE variables. */
341 c = casereader_peek (group, 0);
344 output_split_file_values (ds, c);
348 /* Initialize hash tables. */
349 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
350 hmap_init (&pt->data);
353 for (; (c = casereader_read (group)) != NULL; case_unref (c))
354 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
356 double weight = dict_get_case_weight (dataset_dict (ds), c,
358 if (should_tabulate_case (pt, c, proc->exclude))
360 if (proc->mode == GENERAL)
361 tabulate_general_case (pt, c, weight);
363 tabulate_integer_case (pt, c, weight);
366 pt->missing += weight;
368 casereader_destroy (group);
373 ok = casegrouper_destroy (grouper);
374 ok = proc_commit (ds) && ok;
376 return ok ? CMD_SUCCESS : CMD_CASCADING_FAILURE;
379 /* Parses the TABLES subcommand. */
381 crs_custom_tables (struct lexer *lexer, struct dataset *ds,
382 struct cmd_crosstabs *cmd UNUSED, void *proc_)
384 struct crosstabs_proc *proc = proc_;
385 struct const_var_set *var_set;
387 const struct variable ***by = NULL;
389 size_t *by_nvar = NULL;
394 /* Ensure that this is a TABLES subcommand. */
395 if (!lex_match_id (lexer, "TABLES")
396 && (lex_token (lexer) != T_ID ||
397 dict_lookup_var (dataset_dict (ds), lex_tokid (lexer)) == NULL)
398 && lex_token (lexer) != T_ALL)
400 lex_match (lexer, '=');
402 if (proc->variables != NULL)
403 var_set = const_var_set_create_from_array (proc->variables,
406 var_set = const_var_set_create_from_dict (dataset_dict (ds));
407 assert (var_set != NULL);
411 by = xnrealloc (by, n_by + 1, sizeof *by);
412 by_nvar = xnrealloc (by_nvar, n_by + 1, sizeof *by_nvar);
413 if (!parse_const_var_set_vars (lexer, var_set, &by[n_by], &by_nvar[n_by],
414 PV_NO_DUPLICATE | PV_NO_SCRATCH))
416 if (xalloc_oversized (nx, by_nvar[n_by]))
418 msg (SE, _("Too many cross-tabulation variables or dimensions."));
424 if (!lex_match (lexer, T_BY))
428 lex_error (lexer, _("expecting BY"));
436 by_iter = xcalloc (n_by, sizeof *by_iter);
437 proc->pivots = xnrealloc (proc->pivots,
438 proc->n_pivots + nx, sizeof *proc->pivots);
439 for (i = 0; i < nx; i++)
441 struct pivot_table *pt = &proc->pivots[proc->n_pivots++];
444 pt->weight_format = proc->weight_format;
447 pt->vars = xmalloc (n_by * sizeof *pt->vars);
449 pt->const_vars = NULL;
450 pt->const_values = NULL;
452 for (j = 0; j < n_by; j++)
453 pt->vars[j] = by[j][by_iter[j]];
455 for (j = n_by - 1; j >= 0; j--)
457 if (++by_iter[j] < by_nvar[j])
466 /* All return paths lead here. */
467 for (i = 0; i < n_by; i++)
472 const_var_set_destroy (var_set);
477 /* Parses the VARIABLES subcommand. */
479 crs_custom_variables (struct lexer *lexer, struct dataset *ds,
480 struct cmd_crosstabs *cmd UNUSED, void *proc_)
482 struct crosstabs_proc *proc = proc_;
485 msg (SE, _("VARIABLES must be specified before TABLES."));
489 lex_match (lexer, '=');
493 size_t orig_nv = proc->n_variables;
498 if (!parse_variables_const (lexer, dataset_dict (ds),
499 &proc->variables, &proc->n_variables,
500 (PV_APPEND | PV_NUMERIC
501 | PV_NO_DUPLICATE | PV_NO_SCRATCH)))
504 if (lex_token (lexer) != '(')
506 lex_error (lexer, "expecting `('");
511 if (!lex_force_int (lexer))
513 min = lex_integer (lexer);
516 lex_match (lexer, ',');
518 if (!lex_force_int (lexer))
520 max = lex_integer (lexer);
523 msg (SE, _("Maximum value (%ld) less than minimum value (%ld)."),
529 if (lex_token (lexer) != ')')
531 lex_error (lexer, "expecting `)'");
536 for (i = orig_nv; i < proc->n_variables; i++)
538 struct var_range *vr = xmalloc (sizeof *vr);
541 vr->count = max - min + 1;
542 var_attach_aux (proc->variables[i], vr, var_dtor_free);
545 if (lex_token (lexer) == '/')
552 free (proc->variables);
553 proc->variables = NULL;
554 proc->n_variables = 0;
558 /* Data file processing. */
561 should_tabulate_case (const struct pivot_table *pt, const struct ccase *c,
562 enum mv_class exclude)
565 for (j = 0; j < pt->n_vars; j++)
567 const struct variable *var = pt->vars[j];
568 struct var_range *range = get_var_range (var);
570 if (var_is_value_missing (var, case_data (c, var), exclude))
575 double num = case_num (c, var);
576 if (num < range->min || num > range->max)
584 tabulate_integer_case (struct pivot_table *pt, const struct ccase *c,
587 struct table_entry *te;
592 for (j = 0; j < pt->n_vars; j++)
594 /* Throw away fractional parts of values. */
595 hash = hash_int (case_num (c, pt->vars[j]), hash);
598 HMAP_FOR_EACH_WITH_HASH (te, struct table_entry, node, hash, &pt->data)
600 for (j = 0; j < pt->n_vars; j++)
601 if ((int) case_num (c, pt->vars[j]) != (int) te->values[j].f)
604 /* Found an existing entry. */
611 /* No existing entry. Create a new one. */
612 te = xmalloc (table_entry_size (pt->n_vars));
614 for (j = 0; j < pt->n_vars; j++)
615 te->values[j].f = (int) case_num (c, pt->vars[j]);
616 hmap_insert (&pt->data, &te->node, hash);
620 tabulate_general_case (struct pivot_table *pt, const struct ccase *c,
623 struct table_entry *te;
628 for (j = 0; j < pt->n_vars; j++)
630 const struct variable *var = pt->vars[j];
631 hash = value_hash (case_data (c, var), var_get_width (var), hash);
634 HMAP_FOR_EACH_WITH_HASH (te, struct table_entry, node, hash, &pt->data)
636 for (j = 0; j < pt->n_vars; j++)
638 const struct variable *var = pt->vars[j];
639 if (!value_equal (case_data (c, var), &te->values[j],
640 var_get_width (var)))
644 /* Found an existing entry. */
651 /* No existing entry. Create a new one. */
652 te = xmalloc (table_entry_size (pt->n_vars));
654 for (j = 0; j < pt->n_vars; j++)
656 const struct variable *var = pt->vars[j];
657 value_clone (&te->values[j], case_data (c, var), var_get_width (var));
659 hmap_insert (&pt->data, &te->node, hash);
662 /* Post-data reading calculations. */
664 static int compare_table_entry_vars_3way (const struct table_entry *a,
665 const struct table_entry *b,
666 const struct pivot_table *pt,
668 static int compare_table_entry_3way (const void *ap_, const void *bp_,
670 static void enum_var_values (const struct pivot_table *, int var_idx,
671 union value **valuesp, int *n_values);
672 static void output_pivot_table (struct crosstabs_proc *,
673 struct pivot_table *);
674 static void make_pivot_table_subset (struct pivot_table *pt,
675 size_t row0, size_t row1,
676 struct pivot_table *subset);
677 static void make_summary_table (struct crosstabs_proc *);
678 static bool find_crosstab (struct pivot_table *, size_t *row0p, size_t *row1p);
681 postcalc (struct crosstabs_proc *proc)
683 struct pivot_table *pt;
685 /* Convert hash tables into sorted arrays of entries. */
686 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
688 struct table_entry *e;
691 pt->n_entries = hmap_count (&pt->data);
692 pt->entries = xnmalloc (pt->n_entries, sizeof *pt->entries);
694 HMAP_FOR_EACH (e, struct table_entry, node, &pt->data)
695 pt->entries[i++] = e;
696 hmap_destroy (&pt->data);
698 sort (pt->entries, pt->n_entries, sizeof *pt->entries,
699 compare_table_entry_3way, pt);
702 make_summary_table (proc);
704 /* Output each pivot table. */
705 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
707 if (proc->pivot || pt->n_vars == 2)
708 output_pivot_table (proc, pt);
711 size_t row0 = 0, row1 = 0;
712 while (find_crosstab (pt, &row0, &row1))
714 struct pivot_table subset;
715 make_pivot_table_subset (pt, row0, row1, &subset);
716 output_pivot_table (proc, &subset);
721 /* Free output and prepare for next split file. */
722 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
728 /* Free only the members that were allocated in this
729 function. The other pointer members are either both
730 allocated and destroyed at a lower level (in
731 output_pivot_table), or both allocated and destroyed at
732 a higher level (in crs_custom_tables and free_proc,
734 for (i = 0; i < pt->n_entries; i++)
735 free (pt->entries[i]);
741 make_pivot_table_subset (struct pivot_table *pt, size_t row0, size_t row1,
742 struct pivot_table *subset)
747 assert (pt->n_consts == 0);
748 subset->missing = pt->missing;
750 subset->vars = pt->vars;
751 subset->n_consts = pt->n_vars - 2;
752 subset->const_vars = pt->vars + 2;
753 subset->const_values = &pt->entries[row0]->values[2];
755 subset->entries = &pt->entries[row0];
756 subset->n_entries = row1 - row0;
760 compare_table_entry_var_3way (const struct table_entry *a,
761 const struct table_entry *b,
762 const struct pivot_table *pt,
765 return value_compare_3way (&a->values[idx], &b->values[idx],
766 var_get_width (pt->vars[idx]));
770 compare_table_entry_vars_3way (const struct table_entry *a,
771 const struct table_entry *b,
772 const struct pivot_table *pt,
777 for (i = idx1 - 1; i >= idx0; i--)
779 int cmp = compare_table_entry_var_3way (a, b, pt, i);
786 /* Compare the struct table_entry at *AP to the one at *BP and
787 return a strcmp()-type result. */
789 compare_table_entry_3way (const void *ap_, const void *bp_, const void *pt_)
791 const struct table_entry *const *ap = ap_;
792 const struct table_entry *const *bp = bp_;
793 const struct table_entry *a = *ap;
794 const struct table_entry *b = *bp;
795 const struct pivot_table *pt = pt_;
798 cmp = compare_table_entry_vars_3way (a, b, pt, 2, pt->n_vars);
802 cmp = compare_table_entry_var_3way (a, b, pt, ROW_VAR);
806 return compare_table_entry_var_3way (a, b, pt, COL_VAR);
810 find_first_difference (const struct pivot_table *pt, size_t row)
813 return pt->n_vars - 1;
816 const struct table_entry *a = pt->entries[row];
817 const struct table_entry *b = pt->entries[row - 1];
820 for (col = pt->n_vars - 1; col >= 0; col--)
821 if (compare_table_entry_var_3way (a, b, pt, col))
827 /* Output a table summarizing the cases processed. */
829 make_summary_table (struct crosstabs_proc *proc)
831 struct tab_table *summary;
832 struct pivot_table *pt;
836 summary = tab_create (7, 3 + proc->n_pivots);
837 tab_title (summary, _("Summary."));
838 tab_headers (summary, 1, 0, 3, 0);
839 tab_joint_text (summary, 1, 0, 6, 0, TAB_CENTER, _("Cases"));
840 tab_joint_text (summary, 1, 1, 2, 1, TAB_CENTER, _("Valid"));
841 tab_joint_text (summary, 3, 1, 4, 1, TAB_CENTER, _("Missing"));
842 tab_joint_text (summary, 5, 1, 6, 1, TAB_CENTER, _("Total"));
843 tab_hline (summary, TAL_1, 1, 6, 1);
844 tab_hline (summary, TAL_1, 1, 6, 2);
845 tab_vline (summary, TAL_1, 3, 1, 1);
846 tab_vline (summary, TAL_1, 5, 1, 1);
847 for (i = 0; i < 3; i++)
849 tab_text (summary, 1 + i * 2, 2, TAB_RIGHT, _("N"));
850 tab_text (summary, 2 + i * 2, 2, TAB_RIGHT, _("Percent"));
852 tab_offset (summary, 0, 3);
854 ds_init_empty (&name);
855 for (pt = &proc->pivots[0]; pt < &proc->pivots[proc->n_pivots]; pt++)
861 tab_hline (summary, TAL_1, 0, 6, 0);
864 for (i = 0; i < pt->n_vars; i++)
867 ds_put_cstr (&name, " * ");
868 ds_put_cstr (&name, var_to_string (pt->vars[i]));
870 tab_text (summary, 0, 0, TAB_LEFT, ds_cstr (&name));
873 for (i = 0; i < pt->n_entries; i++)
874 valid += pt->entries[i]->freq;
879 for (i = 0; i < 3; i++)
881 tab_double (summary, i * 2 + 1, 0, TAB_RIGHT, n[i],
882 &proc->weight_format);
883 tab_text_format (summary, i * 2 + 2, 0, TAB_RIGHT, "%.1f%%",
887 tab_next_row (summary);
891 submit (NULL, summary);
896 static struct tab_table *create_crosstab_table (struct crosstabs_proc *,
897 struct pivot_table *);
898 static struct tab_table *create_chisq_table (struct pivot_table *);
899 static struct tab_table *create_sym_table (struct pivot_table *);
900 static struct tab_table *create_risk_table (struct pivot_table *);
901 static struct tab_table *create_direct_table (struct pivot_table *);
902 static void display_dimensions (struct crosstabs_proc *, struct pivot_table *,
903 struct tab_table *, int first_difference);
904 static void display_crosstabulation (struct crosstabs_proc *,
905 struct pivot_table *,
907 static void display_chisq (struct pivot_table *, struct tab_table *,
908 bool *showed_fisher);
909 static void display_symmetric (struct crosstabs_proc *, struct pivot_table *,
911 static void display_risk (struct pivot_table *, struct tab_table *);
912 static void display_directional (struct crosstabs_proc *, struct pivot_table *,
914 static void table_value_missing (struct crosstabs_proc *proc,
915 struct tab_table *table, int c, int r,
916 unsigned char opt, const union value *v,
917 const struct variable *var);
918 static void delete_missing (struct pivot_table *);
919 static void build_matrix (struct pivot_table *);
921 /* Output pivot table beginning at PB and continuing until PE,
922 exclusive. For efficiency, *MATP is a pointer to a matrix that can
923 hold *MAXROWS entries. */
925 output_pivot_table (struct crosstabs_proc *proc, struct pivot_table *pt)
927 struct tab_table *table = NULL; /* Crosstabulation table. */
928 struct tab_table *chisq = NULL; /* Chi-square table. */
929 bool showed_fisher = false;
930 struct tab_table *sym = NULL; /* Symmetric measures table. */
931 struct tab_table *risk = NULL; /* Risk estimate table. */
932 struct tab_table *direct = NULL; /* Directional measures table. */
935 enum_var_values (pt, COL_VAR, &pt->cols, &pt->n_cols);
938 table = create_crosstab_table (proc, pt);
939 if (proc->statistics & (1u << CRS_ST_CHISQ))
940 chisq = create_chisq_table (pt);
941 if (proc->statistics & ((1u << CRS_ST_PHI) | (1u << CRS_ST_CC)
942 | (1u << CRS_ST_BTAU) | (1u << CRS_ST_CTAU)
943 | (1u << CRS_ST_GAMMA) | (1u << CRS_ST_CORR)
944 | (1u << CRS_ST_KAPPA)))
945 sym = create_sym_table (pt);
946 if (proc->statistics & (1u << CRS_ST_RISK))
947 risk = create_risk_table (pt);
948 if (proc->statistics & ((1u << CRS_ST_LAMBDA) | (1u << CRS_ST_UC)
949 | (1u << CRS_ST_D) | (1u << CRS_ST_ETA)))
950 direct = create_direct_table (pt);
953 while (find_crosstab (pt, &row0, &row1))
955 struct pivot_table x;
956 int first_difference;
958 make_pivot_table_subset (pt, row0, row1, &x);
960 /* Find all the row variable values. */
961 enum_var_values (&x, ROW_VAR, &x.rows, &x.n_rows);
963 if (size_overflow_p (xtimes (xtimes (x.n_rows, x.n_cols),
966 x.row_tot = xmalloc (x.n_rows * sizeof *x.row_tot);
967 x.col_tot = xmalloc (x.n_cols * sizeof *x.col_tot);
968 x.mat = xmalloc (x.n_rows * x.n_cols * sizeof *x.mat);
970 /* Allocate table space for the matrix. */
972 && tab_row (table) + (x.n_rows + 1) * proc->n_cells > tab_nr (table))
973 tab_realloc (table, -1,
974 MAX (tab_nr (table) + (x.n_rows + 1) * proc->n_cells,
975 tab_nr (table) * pt->n_entries / x.n_entries));
979 /* Find the first variable that differs from the last subtable. */
980 first_difference = find_first_difference (pt, row0);
983 display_dimensions (proc, &x, table, first_difference);
984 display_crosstabulation (proc, &x, table);
987 if (proc->exclude == MV_NEVER)
992 display_dimensions (proc, &x, chisq, first_difference);
993 display_chisq (&x, chisq, &showed_fisher);
997 display_dimensions (proc, &x, sym, first_difference);
998 display_symmetric (proc, &x, sym);
1002 display_dimensions (proc, &x, risk, first_difference);
1003 display_risk (&x, risk);
1007 display_dimensions (proc, &x, direct, first_difference);
1008 display_directional (proc, &x, direct);
1011 /* Free the parts of x that are not owned by pt. In
1012 particular we must not free x.cols, which is the same as
1013 pt->cols, which is freed at the end of this function. */
1021 submit (NULL, table);
1026 tab_resize (chisq, 4 + (pt->n_vars - 2), -1);
1032 submit (pt, direct);
1038 build_matrix (struct pivot_table *x)
1040 const int col_var_width = var_get_width (x->vars[COL_VAR]);
1041 const int row_var_width = var_get_width (x->vars[ROW_VAR]);
1044 struct table_entry **p;
1048 for (p = x->entries; p < &x->entries[x->n_entries]; p++)
1050 const struct table_entry *te = *p;
1052 while (!value_equal (&x->rows[row], &te->values[ROW_VAR], row_var_width))
1054 for (; col < x->n_cols; col++)
1060 while (!value_equal (&x->cols[col], &te->values[COL_VAR], col_var_width))
1067 if (++col >= x->n_cols)
1073 while (mp < &x->mat[x->n_cols * x->n_rows])
1075 assert (mp == &x->mat[x->n_cols * x->n_rows]);
1077 /* Column totals, row totals, ns_rows. */
1079 for (col = 0; col < x->n_cols; col++)
1080 x->col_tot[col] = 0.0;
1081 for (row = 0; row < x->n_rows; row++)
1082 x->row_tot[row] = 0.0;
1084 for (row = 0; row < x->n_rows; row++)
1086 bool row_is_empty = true;
1087 for (col = 0; col < x->n_cols; col++)
1091 row_is_empty = false;
1092 x->col_tot[col] += *mp;
1093 x->row_tot[row] += *mp;
1100 assert (mp == &x->mat[x->n_cols * x->n_rows]);
1104 for (col = 0; col < x->n_cols; col++)
1105 for (row = 0; row < x->n_rows; row++)
1106 if (x->mat[col + row * x->n_cols] != 0.0)
1114 for (col = 0; col < x->n_cols; col++)
1115 x->total += x->col_tot[col];
1118 static struct tab_table *
1119 create_crosstab_table (struct crosstabs_proc *proc, struct pivot_table *pt)
1126 static const struct tuple names[] =
1128 {CRS_CL_COUNT, N_("count")},
1129 {CRS_CL_ROW, N_("row %")},
1130 {CRS_CL_COLUMN, N_("column %")},
1131 {CRS_CL_TOTAL, N_("total %")},
1132 {CRS_CL_EXPECTED, N_("expected")},
1133 {CRS_CL_RESIDUAL, N_("residual")},
1134 {CRS_CL_SRESIDUAL, N_("std. resid.")},
1135 {CRS_CL_ASRESIDUAL, N_("adj. resid.")},
1137 const int n_names = sizeof names / sizeof *names;
1138 const struct tuple *t;
1140 struct tab_table *table;
1141 struct string title;
1142 struct pivot_table x;
1146 make_pivot_table_subset (pt, 0, 0, &x);
1148 table = tab_create (x.n_consts + 1 + x.n_cols + 1,
1149 (x.n_entries / x.n_cols) * 3 / 2 * proc->n_cells + 10);
1150 tab_headers (table, x.n_consts + 1, 0, 2, 0);
1152 /* First header line. */
1153 tab_joint_text (table, x.n_consts + 1, 0,
1154 (x.n_consts + 1) + (x.n_cols - 1), 0,
1155 TAB_CENTER | TAT_TITLE, var_get_name (x.vars[COL_VAR]));
1157 tab_hline (table, TAL_1, x.n_consts + 1,
1158 x.n_consts + 2 + x.n_cols - 2, 1);
1160 /* Second header line. */
1161 for (i = 2; i < x.n_consts + 2; i++)
1162 tab_joint_text (table, x.n_consts + 2 - i - 1, 0,
1163 x.n_consts + 2 - i - 1, 1,
1164 TAB_RIGHT | TAT_TITLE, var_to_string (x.vars[i]));
1165 tab_text (table, x.n_consts + 2 - 2, 1, TAB_RIGHT | TAT_TITLE,
1166 var_get_name (x.vars[ROW_VAR]));
1167 for (i = 0; i < x.n_cols; i++)
1168 table_value_missing (proc, table, x.n_consts + 2 + i - 1, 1, TAB_RIGHT,
1169 &x.cols[i], x.vars[COL_VAR]);
1170 tab_text (table, x.n_consts + 2 + x.n_cols - 1, 1, TAB_CENTER, _("Total"));
1172 tab_hline (table, TAL_1, 0, x.n_consts + 2 + x.n_cols - 1, 2);
1173 tab_vline (table, TAL_1, x.n_consts + 2 + x.n_cols - 1, 0, 1);
1176 ds_init_empty (&title);
1177 for (i = 0; i < x.n_consts + 2; i++)
1180 ds_put_cstr (&title, " * ");
1181 ds_put_cstr (&title, var_get_name (x.vars[i]));
1183 for (i = 0; i < pt->n_consts; i++)
1185 const struct variable *var = pt->const_vars[i];
1189 ds_put_format (&title, ", %s=", var_get_name (var));
1191 /* Insert the formatted value of the variable, then trim
1192 leading spaces in what was just inserted. */
1193 ofs = ds_length (&title);
1194 s = data_out (&pt->const_values[i], var_get_encoding (var),
1195 var_get_print_format (var));
1196 ds_put_cstr (&title, s);
1198 ds_remove (&title, ofs, ss_cspan (ds_substr (&title, ofs, SIZE_MAX),
1202 ds_put_cstr (&title, " [");
1204 for (t = names; t < &names[n_names]; t++)
1205 if (proc->cells & (1u << t->value))
1208 ds_put_cstr (&title, ", ");
1209 ds_put_cstr (&title, gettext (t->name));
1211 ds_put_cstr (&title, "].");
1213 tab_title (table, "%s", ds_cstr (&title));
1214 ds_destroy (&title);
1216 tab_offset (table, 0, 2);
1220 static struct tab_table *
1221 create_chisq_table (struct pivot_table *pt)
1223 struct tab_table *chisq;
1225 chisq = tab_create (6 + (pt->n_vars - 2),
1226 pt->n_entries / pt->n_cols * 3 / 2 * N_CHISQ + 10);
1227 tab_headers (chisq, 1 + (pt->n_vars - 2), 0, 1, 0);
1229 tab_title (chisq, _("Chi-square tests."));
1231 tab_offset (chisq, pt->n_vars - 2, 0);
1232 tab_text (chisq, 0, 0, TAB_LEFT | TAT_TITLE, _("Statistic"));
1233 tab_text (chisq, 1, 0, TAB_RIGHT | TAT_TITLE, _("Value"));
1234 tab_text (chisq, 2, 0, TAB_RIGHT | TAT_TITLE, _("df"));
1235 tab_text (chisq, 3, 0, TAB_RIGHT | TAT_TITLE,
1236 _("Asymp. Sig. (2-sided)"));
1237 tab_text (chisq, 4, 0, TAB_RIGHT | TAT_TITLE,
1238 _("Exact Sig. (2-sided)"));
1239 tab_text (chisq, 5, 0, TAB_RIGHT | TAT_TITLE,
1240 _("Exact Sig. (1-sided)"));
1241 tab_offset (chisq, 0, 1);
1246 /* Symmetric measures. */
1247 static struct tab_table *
1248 create_sym_table (struct pivot_table *pt)
1250 struct tab_table *sym;
1252 sym = tab_create (6 + (pt->n_vars - 2),
1253 pt->n_entries / pt->n_cols * 7 + 10);
1254 tab_headers (sym, 2 + (pt->n_vars - 2), 0, 1, 0);
1255 tab_title (sym, _("Symmetric measures."));
1257 tab_offset (sym, pt->n_vars - 2, 0);
1258 tab_text (sym, 0, 0, TAB_LEFT | TAT_TITLE, _("Category"));
1259 tab_text (sym, 1, 0, TAB_LEFT | TAT_TITLE, _("Statistic"));
1260 tab_text (sym, 2, 0, TAB_RIGHT | TAT_TITLE, _("Value"));
1261 tab_text (sym, 3, 0, TAB_RIGHT | TAT_TITLE, _("Asymp. Std. Error"));
1262 tab_text (sym, 4, 0, TAB_RIGHT | TAT_TITLE, _("Approx. T"));
1263 tab_text (sym, 5, 0, TAB_RIGHT | TAT_TITLE, _("Approx. Sig."));
1264 tab_offset (sym, 0, 1);
1269 /* Risk estimate. */
1270 static struct tab_table *
1271 create_risk_table (struct pivot_table *pt)
1273 struct tab_table *risk;
1275 risk = tab_create (4 + (pt->n_vars - 2), pt->n_entries / pt->n_cols * 4 + 10);
1276 tab_headers (risk, 1 + pt->n_vars - 2, 0, 2, 0);
1277 tab_title (risk, _("Risk estimate."));
1279 tab_offset (risk, pt->n_vars - 2, 0);
1280 tab_joint_text_format (risk, 2, 0, 3, 0, TAB_CENTER | TAT_TITLE,
1281 _("95%% Confidence Interval"));
1282 tab_text (risk, 0, 1, TAB_LEFT | TAT_TITLE, _("Statistic"));
1283 tab_text (risk, 1, 1, TAB_RIGHT | TAT_TITLE, _("Value"));
1284 tab_text (risk, 2, 1, TAB_RIGHT | TAT_TITLE, _("Lower"));
1285 tab_text (risk, 3, 1, TAB_RIGHT | TAT_TITLE, _("Upper"));
1286 tab_hline (risk, TAL_1, 2, 3, 1);
1287 tab_vline (risk, TAL_1, 2, 0, 1);
1288 tab_offset (risk, 0, 2);
1293 /* Directional measures. */
1294 static struct tab_table *
1295 create_direct_table (struct pivot_table *pt)
1297 struct tab_table *direct;
1299 direct = tab_create (7 + (pt->n_vars - 2),
1300 pt->n_entries / pt->n_cols * 7 + 10);
1301 tab_headers (direct, 3 + (pt->n_vars - 2), 0, 1, 0);
1302 tab_title (direct, _("Directional measures."));
1304 tab_offset (direct, pt->n_vars - 2, 0);
1305 tab_text (direct, 0, 0, TAB_LEFT | TAT_TITLE, _("Category"));
1306 tab_text (direct, 1, 0, TAB_LEFT | TAT_TITLE, _("Statistic"));
1307 tab_text (direct, 2, 0, TAB_LEFT | TAT_TITLE, _("Type"));
1308 tab_text (direct, 3, 0, TAB_RIGHT | TAT_TITLE, _("Value"));
1309 tab_text (direct, 4, 0, TAB_RIGHT | TAT_TITLE, _("Asymp. Std. Error"));
1310 tab_text (direct, 5, 0, TAB_RIGHT | TAT_TITLE, _("Approx. T"));
1311 tab_text (direct, 6, 0, TAB_RIGHT | TAT_TITLE, _("Approx. Sig."));
1312 tab_offset (direct, 0, 1);
1318 /* Delete missing rows and columns for statistical analysis when
1321 delete_missing (struct pivot_table *pt)
1325 for (r = 0; r < pt->n_rows; r++)
1326 if (var_is_num_missing (pt->vars[ROW_VAR], pt->rows[r].f, MV_USER))
1328 for (c = 0; c < pt->n_cols; c++)
1329 pt->mat[c + r * pt->n_cols] = 0.;
1334 for (c = 0; c < pt->n_cols; c++)
1335 if (var_is_num_missing (pt->vars[COL_VAR], pt->cols[c].f, MV_USER))
1337 for (r = 0; r < pt->n_rows; r++)
1338 pt->mat[c + r * pt->n_cols] = 0.;
1343 /* Prepare table T for submission, and submit it. */
1345 submit (struct pivot_table *pt, struct tab_table *t)
1352 tab_resize (t, -1, 0);
1353 if (tab_nr (t) == tab_t (t))
1355 table_unref (&t->table);
1358 tab_offset (t, 0, 0);
1360 for (i = 2; i < pt->n_vars; i++)
1361 tab_text (t, pt->n_vars - i - 1, 0, TAB_RIGHT | TAT_TITLE,
1362 var_to_string (pt->vars[i]));
1363 tab_box (t, TAL_2, TAL_2, -1, -1, 0, 0, tab_nc (t) - 1, tab_nr (t) - 1);
1364 tab_box (t, -1, -1, -1, TAL_1, tab_l (t), tab_t (t) - 1, tab_nc (t) - 1,
1366 tab_box (t, -1, -1, -1, TAL_GAP, 0, tab_t (t), tab_l (t) - 1,
1368 tab_vline (t, TAL_2, tab_l (t), 0, tab_nr (t) - 1);
1374 find_crosstab (struct pivot_table *pt, size_t *row0p, size_t *row1p)
1376 size_t row0 = *row1p;
1379 if (row0 >= pt->n_entries)
1382 for (row1 = row0 + 1; row1 < pt->n_entries; row1++)
1384 struct table_entry *a = pt->entries[row0];
1385 struct table_entry *b = pt->entries[row1];
1386 if (compare_table_entry_vars_3way (a, b, pt, 2, pt->n_vars) != 0)
1394 /* Compares `union value's A_ and B_ and returns a strcmp()-like
1395 result. WIDTH_ points to an int which is either 0 for a
1396 numeric value or a string width for a string value. */
1398 compare_value_3way (const void *a_, const void *b_, const void *width_)
1400 const union value *a = a_;
1401 const union value *b = b_;
1402 const int *width = width_;
1404 return value_compare_3way (a, b, *width);
1407 /* Given an array of ENTRY_CNT table_entry structures starting at
1408 ENTRIES, creates a sorted list of the values that the variable
1409 with index VAR_IDX takes on. The values are returned as a
1410 malloc()'d array stored in *VALUES, with the number of values
1411 stored in *VALUE_CNT.
1414 enum_var_values (const struct pivot_table *pt, int var_idx,
1415 union value **valuesp, int *n_values)
1417 const struct variable *var = pt->vars[var_idx];
1418 struct var_range *range = get_var_range (var);
1419 union value *values;
1424 values = *valuesp = xnmalloc (range->count, sizeof *values);
1425 *n_values = range->count;
1426 for (i = 0; i < range->count; i++)
1427 values[i].f = range->min + i;
1431 int width = var_get_width (var);
1432 struct hmapx_node *node;
1433 const union value *iter;
1437 for (i = 0; i < pt->n_entries; i++)
1439 const struct table_entry *te = pt->entries[i];
1440 const union value *value = &te->values[var_idx];
1441 size_t hash = value_hash (value, width, 0);
1443 HMAPX_FOR_EACH_WITH_HASH (iter, node, hash, &set)
1444 if (value_equal (iter, value, width))
1447 hmapx_insert (&set, (union value *) value, hash);
1452 *n_values = hmapx_count (&set);
1453 values = *valuesp = xnmalloc (*n_values, sizeof *values);
1455 HMAPX_FOR_EACH (iter, node, &set)
1456 values[i++] = *iter;
1457 hmapx_destroy (&set);
1459 sort (values, *n_values, sizeof *values, compare_value_3way, &width);
1463 /* Sets cell (C,R) in TABLE, with options OPT, to have a value taken
1464 from V, displayed with print format spec from variable VAR. When
1465 in REPORT missing-value mode, missing values have an M appended. */
1467 table_value_missing (struct crosstabs_proc *proc,
1468 struct tab_table *table, int c, int r, unsigned char opt,
1469 const union value *v, const struct variable *var)
1471 const char *label = var_lookup_value_label (var, v);
1473 tab_text (table, c, r, TAB_LEFT, label);
1476 const struct fmt_spec *print = var_get_print_format (var);
1477 if (proc->exclude == MV_NEVER && var_is_value_missing (var, v, MV_USER))
1479 char *s = data_out (v, dict_get_encoding (proc->dict), print);
1480 tab_text_format (table, c, r, opt, "%sM", s + strspn (s, " "));
1484 tab_value (table, c, r, opt, v, proc->dict, print);
1488 /* Draws a line across TABLE at the current row to indicate the most
1489 major dimension variable with index FIRST_DIFFERENCE out of N_VARS
1490 that changed, and puts the values that changed into the table. TB
1491 and PT must be the corresponding table_entry and crosstab,
1494 display_dimensions (struct crosstabs_proc *proc, struct pivot_table *pt,
1495 struct tab_table *table, int first_difference)
1497 tab_hline (table, TAL_1, pt->n_consts + pt->n_vars - first_difference - 1, tab_nc (table) - 1, 0);
1499 for (; first_difference >= 2; first_difference--)
1500 table_value_missing (proc, table, pt->n_consts + pt->n_vars - first_difference - 1, 0,
1501 TAB_RIGHT, &pt->entries[0]->values[first_difference],
1502 pt->vars[first_difference]);
1505 /* Put VALUE into cell (C,R) of TABLE, suffixed with character
1506 SUFFIX if nonzero. If MARK_MISSING is true the entry is
1507 additionally suffixed with a letter `M'. */
1509 format_cell_entry (struct tab_table *table, int c, int r, double value,
1510 char suffix, bool mark_missing, const struct dictionary *dict)
1512 const struct fmt_spec f = {FMT_F, 10, 1};
1519 s = data_out (&v, dict_get_encoding (dict), &f);
1523 suffixes[suffix_len++] = suffix;
1525 suffixes[suffix_len++] = 'M';
1526 suffixes[suffix_len] = '\0';
1528 tab_text_format (table, c, r, TAB_RIGHT, "%s%s",
1529 s + strspn (s, " "), suffixes);
1532 /* Displays the crosstabulation table. */
1534 display_crosstabulation (struct crosstabs_proc *proc, struct pivot_table *pt,
1535 struct tab_table *table)
1541 for (r = 0; r < pt->n_rows; r++)
1542 table_value_missing (proc, table, pt->n_consts + pt->n_vars - 2,
1543 r * proc->n_cells, TAB_RIGHT, &pt->rows[r],
1546 tab_text (table, pt->n_vars - 2, pt->n_rows * proc->n_cells,
1547 TAB_LEFT, _("Total"));
1549 /* Put in the actual cells. */
1551 tab_offset (table, pt->n_consts + pt->n_vars - 1, -1);
1552 for (r = 0; r < pt->n_rows; r++)
1554 if (proc->n_cells > 1)
1555 tab_hline (table, TAL_1, -1, pt->n_cols, 0);
1556 for (c = 0; c < pt->n_cols; c++)
1558 bool mark_missing = false;
1559 double expected_value = pt->row_tot[r] * pt->col_tot[c] / pt->total;
1560 if (proc->exclude == MV_NEVER
1561 && (var_is_num_missing (pt->vars[COL_VAR], pt->cols[c].f, MV_USER)
1562 || var_is_num_missing (pt->vars[ROW_VAR], pt->rows[r].f,
1564 mark_missing = true;
1565 for (i = 0; i < proc->n_cells; i++)
1570 switch (proc->a_cells[i])
1576 v = *mp / pt->row_tot[r] * 100.;
1580 v = *mp / pt->col_tot[c] * 100.;
1584 v = *mp / pt->total * 100.;
1587 case CRS_CL_EXPECTED:
1590 case CRS_CL_RESIDUAL:
1591 v = *mp - expected_value;
1593 case CRS_CL_SRESIDUAL:
1594 v = (*mp - expected_value) / sqrt (expected_value);
1596 case CRS_CL_ASRESIDUAL:
1597 v = ((*mp - expected_value)
1598 / sqrt (expected_value
1599 * (1. - pt->row_tot[r] / pt->total)
1600 * (1. - pt->col_tot[c] / pt->total)));
1605 format_cell_entry (table, c, i, v, suffix, mark_missing, proc->dict);
1611 tab_offset (table, -1, tab_row (table) + proc->n_cells);
1615 tab_offset (table, -1, tab_row (table) - proc->n_cells * pt->n_rows);
1616 for (r = 0; r < pt->n_rows; r++)
1618 bool mark_missing = false;
1620 if (proc->exclude == MV_NEVER
1621 && var_is_num_missing (pt->vars[ROW_VAR], pt->rows[r].f, MV_USER))
1622 mark_missing = true;
1624 for (i = 0; i < proc->n_cells; i++)
1629 switch (proc->a_cells[i])
1639 v = pt->row_tot[r] / pt->total * 100.;
1643 v = pt->row_tot[r] / pt->total * 100.;
1646 case CRS_CL_EXPECTED:
1647 case CRS_CL_RESIDUAL:
1648 case CRS_CL_SRESIDUAL:
1649 case CRS_CL_ASRESIDUAL:
1656 format_cell_entry (table, pt->n_cols, 0, v, suffix, mark_missing, proc->dict);
1657 tab_next_row (table);
1661 /* Column totals, grand total. */
1663 if (proc->n_cells > 1)
1664 tab_hline (table, TAL_1, -1, pt->n_cols, 0);
1665 for (c = 0; c <= pt->n_cols; c++)
1667 double ct = c < pt->n_cols ? pt->col_tot[c] : pt->total;
1668 bool mark_missing = false;
1671 if (proc->exclude == MV_NEVER && c < pt->n_cols
1672 && var_is_num_missing (pt->vars[COL_VAR], pt->cols[c].f, MV_USER))
1673 mark_missing = true;
1675 for (i = 0; i < proc->n_cells; i++)
1680 switch (proc->a_cells[i])
1686 v = ct / pt->total * 100.;
1694 v = ct / pt->total * 100.;
1697 case CRS_CL_EXPECTED:
1698 case CRS_CL_RESIDUAL:
1699 case CRS_CL_SRESIDUAL:
1700 case CRS_CL_ASRESIDUAL:
1706 format_cell_entry (table, c, i, v, suffix, mark_missing, proc->dict);
1711 tab_offset (table, -1, tab_row (table) + last_row);
1712 tab_offset (table, 0, -1);
1715 static void calc_r (struct pivot_table *,
1716 double *PT, double *Y, double *, double *, double *);
1717 static void calc_chisq (struct pivot_table *,
1718 double[N_CHISQ], int[N_CHISQ], double *, double *);
1720 /* Display chi-square statistics. */
1722 display_chisq (struct pivot_table *pt, struct tab_table *chisq,
1723 bool *showed_fisher)
1725 static const char *chisq_stats[N_CHISQ] =
1727 N_("Pearson Chi-Square"),
1728 N_("Likelihood Ratio"),
1729 N_("Fisher's Exact Test"),
1730 N_("Continuity Correction"),
1731 N_("Linear-by-Linear Association"),
1733 double chisq_v[N_CHISQ];
1734 double fisher1, fisher2;
1739 calc_chisq (pt, chisq_v, df, &fisher1, &fisher2);
1741 tab_offset (chisq, pt->n_vars - 2, -1);
1743 for (i = 0; i < N_CHISQ; i++)
1745 if ((i != 2 && chisq_v[i] == SYSMIS)
1746 || (i == 2 && fisher1 == SYSMIS))
1749 tab_text (chisq, 0, 0, TAB_LEFT, gettext (chisq_stats[i]));
1752 tab_double (chisq, 1, 0, TAB_RIGHT, chisq_v[i], NULL);
1753 tab_double (chisq, 2, 0, TAB_RIGHT, df[i], &pt->weight_format);
1754 tab_double (chisq, 3, 0, TAB_RIGHT,
1755 gsl_cdf_chisq_Q (chisq_v[i], df[i]), NULL);
1759 *showed_fisher = true;
1760 tab_double (chisq, 4, 0, TAB_RIGHT, fisher2, NULL);
1761 tab_double (chisq, 5, 0, TAB_RIGHT, fisher1, NULL);
1763 tab_next_row (chisq);
1766 tab_text (chisq, 0, 0, TAB_LEFT, _("N of Valid Cases"));
1767 tab_double (chisq, 1, 0, TAB_RIGHT, pt->total, &pt->weight_format);
1768 tab_next_row (chisq);
1770 tab_offset (chisq, 0, -1);
1773 static int calc_symmetric (struct crosstabs_proc *, struct pivot_table *,
1774 double[N_SYMMETRIC], double[N_SYMMETRIC],
1775 double[N_SYMMETRIC],
1776 double[3], double[3], double[3]);
1778 /* Display symmetric measures. */
1780 display_symmetric (struct crosstabs_proc *proc, struct pivot_table *pt,
1781 struct tab_table *sym)
1783 static const char *categories[] =
1785 N_("Nominal by Nominal"),
1786 N_("Ordinal by Ordinal"),
1787 N_("Interval by Interval"),
1788 N_("Measure of Agreement"),
1791 static const char *stats[N_SYMMETRIC] =
1795 N_("Contingency Coefficient"),
1796 N_("Kendall's tau-b"),
1797 N_("Kendall's tau-c"),
1799 N_("Spearman Correlation"),
1804 static const int stats_categories[N_SYMMETRIC] =
1806 0, 0, 0, 1, 1, 1, 1, 2, 3,
1810 double sym_v[N_SYMMETRIC], sym_ase[N_SYMMETRIC], sym_t[N_SYMMETRIC];
1811 double somers_d_v[3], somers_d_ase[3], somers_d_t[3];
1814 if (!calc_symmetric (proc, pt, sym_v, sym_ase, sym_t,
1815 somers_d_v, somers_d_ase, somers_d_t))
1818 tab_offset (sym, pt->n_vars - 2, -1);
1820 for (i = 0; i < N_SYMMETRIC; i++)
1822 if (sym_v[i] == SYSMIS)
1825 if (stats_categories[i] != last_cat)
1827 last_cat = stats_categories[i];
1828 tab_text (sym, 0, 0, TAB_LEFT, gettext (categories[last_cat]));
1831 tab_text (sym, 1, 0, TAB_LEFT, gettext (stats[i]));
1832 tab_double (sym, 2, 0, TAB_RIGHT, sym_v[i], NULL);
1833 if (sym_ase[i] != SYSMIS)
1834 tab_double (sym, 3, 0, TAB_RIGHT, sym_ase[i], NULL);
1835 if (sym_t[i] != SYSMIS)
1836 tab_double (sym, 4, 0, TAB_RIGHT, sym_t[i], NULL);
1837 /*tab_double (sym, 5, 0, TAB_RIGHT, normal_sig (sym_v[i]), NULL);*/
1841 tab_text (sym, 0, 0, TAB_LEFT, _("N of Valid Cases"));
1842 tab_double (sym, 2, 0, TAB_RIGHT, pt->total, &pt->weight_format);
1845 tab_offset (sym, 0, -1);
1848 static int calc_risk (struct pivot_table *,
1849 double[], double[], double[], union value *);
1851 /* Display risk estimate. */
1853 display_risk (struct pivot_table *pt, struct tab_table *risk)
1856 double risk_v[3], lower[3], upper[3];
1860 if (!calc_risk (pt, risk_v, upper, lower, c))
1863 tab_offset (risk, pt->n_vars - 2, -1);
1865 for (i = 0; i < 3; i++)
1867 const struct variable *cv = pt->vars[COL_VAR];
1868 const struct variable *rv = pt->vars[ROW_VAR];
1869 int cvw = var_get_width (cv);
1870 int rvw = var_get_width (rv);
1872 if (risk_v[i] == SYSMIS)
1878 if (var_is_numeric (cv))
1879 sprintf (buf, _("Odds Ratio for %s (%g / %g)"),
1880 var_get_name (cv), c[0].f, c[1].f);
1882 sprintf (buf, _("Odds Ratio for %s (%.*s / %.*s)"),
1884 cvw, value_str (&c[0], cvw),
1885 cvw, value_str (&c[1], cvw));
1889 if (var_is_numeric (rv))
1890 sprintf (buf, _("For cohort %s = %g"),
1891 var_get_name (rv), pt->rows[i - 1].f);
1893 sprintf (buf, _("For cohort %s = %.*s"),
1895 rvw, value_str (&pt->rows[i - 1], rvw));
1899 tab_text (risk, 0, 0, TAB_LEFT, buf);
1900 tab_double (risk, 1, 0, TAB_RIGHT, risk_v[i], NULL);
1901 tab_double (risk, 2, 0, TAB_RIGHT, lower[i], NULL);
1902 tab_double (risk, 3, 0, TAB_RIGHT, upper[i], NULL);
1903 tab_next_row (risk);
1906 tab_text (risk, 0, 0, TAB_LEFT, _("N of Valid Cases"));
1907 tab_double (risk, 1, 0, TAB_RIGHT, pt->total, &pt->weight_format);
1908 tab_next_row (risk);
1910 tab_offset (risk, 0, -1);
1913 static int calc_directional (struct crosstabs_proc *, struct pivot_table *,
1914 double[N_DIRECTIONAL], double[N_DIRECTIONAL],
1915 double[N_DIRECTIONAL]);
1917 /* Display directional measures. */
1919 display_directional (struct crosstabs_proc *proc, struct pivot_table *pt,
1920 struct tab_table *direct)
1922 static const char *categories[] =
1924 N_("Nominal by Nominal"),
1925 N_("Ordinal by Ordinal"),
1926 N_("Nominal by Interval"),
1929 static const char *stats[] =
1932 N_("Goodman and Kruskal tau"),
1933 N_("Uncertainty Coefficient"),
1938 static const char *types[] =
1945 static const int stats_categories[N_DIRECTIONAL] =
1947 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2,
1950 static const int stats_stats[N_DIRECTIONAL] =
1952 0, 0, 0, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4,
1955 static const int stats_types[N_DIRECTIONAL] =
1957 0, 1, 2, 1, 2, 0, 1, 2, 0, 1, 2, 1, 2,
1960 static const int *stats_lookup[] =
1967 static const char **stats_names[] =
1979 double direct_v[N_DIRECTIONAL];
1980 double direct_ase[N_DIRECTIONAL];
1981 double direct_t[N_DIRECTIONAL];
1985 if (!calc_directional (proc, pt, direct_v, direct_ase, direct_t))
1988 tab_offset (direct, pt->n_vars - 2, -1);
1990 for (i = 0; i < N_DIRECTIONAL; i++)
1992 if (direct_v[i] == SYSMIS)
1998 for (j = 0; j < 3; j++)
1999 if (last[j] != stats_lookup[j][i])
2002 tab_hline (direct, TAL_1, j, 6, 0);
2007 int k = last[j] = stats_lookup[j][i];
2012 string = var_get_name (pt->vars[0]);
2014 string = var_get_name (pt->vars[1]);
2016 tab_text_format (direct, j, 0, TAB_LEFT,
2017 gettext (stats_names[j][k]), string);
2022 tab_double (direct, 3, 0, TAB_RIGHT, direct_v[i], NULL);
2023 if (direct_ase[i] != SYSMIS)
2024 tab_double (direct, 4, 0, TAB_RIGHT, direct_ase[i], NULL);
2025 if (direct_t[i] != SYSMIS)
2026 tab_double (direct, 5, 0, TAB_RIGHT, direct_t[i], NULL);
2027 /*tab_double (direct, 6, 0, TAB_RIGHT, normal_sig (direct_v[i]), NULL);*/
2028 tab_next_row (direct);
2031 tab_offset (direct, 0, -1);
2034 /* Statistical calculations. */
2036 /* Returns the value of the gamma (factorial) function for an integer
2039 gamma_int (double pt)
2044 for (i = 2; i < pt; i++)
2049 /* Calculate P_r as specified in _SPSS Statistical Algorithms_,
2051 static inline double
2052 Pr (int a, int b, int c, int d)
2054 return (gamma_int (a + b + 1.) / gamma_int (a + 1.)
2055 * gamma_int (c + d + 1.) / gamma_int (b + 1.)
2056 * gamma_int (a + c + 1.) / gamma_int (c + 1.)
2057 * gamma_int (b + d + 1.) / gamma_int (d + 1.)
2058 / gamma_int (a + b + c + d + 1.));
2061 /* Swap the contents of A and B. */
2063 swap (int *a, int *b)
2070 /* Calculate significance for Fisher's exact test as specified in
2071 _SPSS Statistical Algorithms_, Appendix 5. */
2073 calc_fisher (int a, int b, int c, int d, double *fisher1, double *fisher2)
2077 if (MIN (c, d) < MIN (a, b))
2078 swap (&a, &c), swap (&b, &d);
2079 if (MIN (b, d) < MIN (a, c))
2080 swap (&a, &b), swap (&c, &d);
2084 swap (&a, &b), swap (&c, &d);
2086 swap (&a, &c), swap (&b, &d);
2090 for (pt = 0; pt <= a; pt++)
2091 *fisher1 += Pr (a - pt, b + pt, c + pt, d - pt);
2093 *fisher2 = *fisher1;
2094 for (pt = 1; pt <= b; pt++)
2095 *fisher2 += Pr (a + pt, b - pt, c - pt, d + pt);
2098 /* Calculates chi-squares into CHISQ. MAT is a matrix with N_COLS
2099 columns with values COLS and N_ROWS rows with values ROWS. Values
2100 in the matrix sum to pt->total. */
2102 calc_chisq (struct pivot_table *pt,
2103 double chisq[N_CHISQ], int df[N_CHISQ],
2104 double *fisher1, double *fisher2)
2108 chisq[0] = chisq[1] = 0.;
2109 chisq[2] = chisq[3] = chisq[4] = SYSMIS;
2110 *fisher1 = *fisher2 = SYSMIS;
2112 df[0] = df[1] = (pt->ns_cols - 1) * (pt->ns_rows - 1);
2114 if (pt->ns_rows <= 1 || pt->ns_cols <= 1)
2116 chisq[0] = chisq[1] = SYSMIS;
2120 for (r = 0; r < pt->n_rows; r++)
2121 for (c = 0; c < pt->n_cols; c++)
2123 const double expected = pt->row_tot[r] * pt->col_tot[c] / pt->total;
2124 const double freq = pt->mat[pt->n_cols * r + c];
2125 const double residual = freq - expected;
2127 chisq[0] += residual * residual / expected;
2129 chisq[1] += freq * log (expected / freq);
2140 /* Calculate Yates and Fisher exact test. */
2141 if (pt->ns_cols == 2 && pt->ns_rows == 2)
2143 double f11, f12, f21, f22;
2149 for (i = j = 0; i < pt->n_cols; i++)
2150 if (pt->col_tot[i] != 0.)
2159 f11 = pt->mat[nz_cols[0]];
2160 f12 = pt->mat[nz_cols[1]];
2161 f21 = pt->mat[nz_cols[0] + pt->n_cols];
2162 f22 = pt->mat[nz_cols[1] + pt->n_cols];
2167 const double pt_ = fabs (f11 * f22 - f12 * f21) - 0.5 * pt->total;
2170 chisq[3] = (pt->total * pow2 (pt_)
2171 / (f11 + f12) / (f21 + f22)
2172 / (f11 + f21) / (f12 + f22));
2180 if (f11 < 5. || f12 < 5. || f21 < 5. || f22 < 5.)
2181 calc_fisher (f11 + .5, f12 + .5, f21 + .5, f22 + .5, fisher1, fisher2);
2184 /* Calculate Mantel-Haenszel. */
2185 if (var_is_numeric (pt->vars[ROW_VAR]) && var_is_numeric (pt->vars[COL_VAR]))
2187 double r, ase_0, ase_1;
2188 calc_r (pt, (double *) pt->rows, (double *) pt->cols, &r, &ase_0, &ase_1);
2190 chisq[4] = (pt->total - 1.) * r * r;
2195 /* Calculate the value of Pearson's r. r is stored into R, ase_1 into
2196 ASE_1, and ase_0 into ASE_0. The row and column values must be
2197 passed in PT and Y. */
2199 calc_r (struct pivot_table *pt,
2200 double *PT, double *Y, double *r, double *ase_0, double *ase_1)
2202 double SX, SY, S, T;
2204 double sum_XYf, sum_X2Y2f;
2205 double sum_Xr, sum_X2r;
2206 double sum_Yc, sum_Y2c;
2209 for (sum_X2Y2f = sum_XYf = 0., i = 0; i < pt->n_rows; i++)
2210 for (j = 0; j < pt->n_cols; j++)
2212 double fij = pt->mat[j + i * pt->n_cols];
2213 double product = PT[i] * Y[j];
2214 double temp = fij * product;
2216 sum_X2Y2f += temp * product;
2219 for (sum_Xr = sum_X2r = 0., i = 0; i < pt->n_rows; i++)
2221 sum_Xr += PT[i] * pt->row_tot[i];
2222 sum_X2r += pow2 (PT[i]) * pt->row_tot[i];
2224 Xbar = sum_Xr / pt->total;
2226 for (sum_Yc = sum_Y2c = 0., i = 0; i < pt->n_cols; i++)
2228 sum_Yc += Y[i] * pt->col_tot[i];
2229 sum_Y2c += Y[i] * Y[i] * pt->col_tot[i];
2231 Ybar = sum_Yc / pt->total;
2233 S = sum_XYf - sum_Xr * sum_Yc / pt->total;
2234 SX = sum_X2r - pow2 (sum_Xr) / pt->total;
2235 SY = sum_Y2c - pow2 (sum_Yc) / pt->total;
2238 *ase_0 = sqrt ((sum_X2Y2f - pow2 (sum_XYf) / pt->total) / (sum_X2r * sum_Y2c));
2243 for (s = c = 0., i = 0; i < pt->n_rows; i++)
2244 for (j = 0; j < pt->n_cols; j++)
2246 double Xresid, Yresid;
2249 Xresid = PT[i] - Xbar;
2250 Yresid = Y[j] - Ybar;
2251 temp = (T * Xresid * Yresid
2253 * (Xresid * Xresid * SY + Yresid * Yresid * SX)));
2254 y = pt->mat[j + i * pt->n_cols] * temp * temp - c;
2259 *ase_1 = sqrt (s) / (T * T);
2263 /* Calculate symmetric statistics and their asymptotic standard
2264 errors. Returns 0 if none could be calculated. */
2266 calc_symmetric (struct crosstabs_proc *proc, struct pivot_table *pt,
2267 double v[N_SYMMETRIC], double ase[N_SYMMETRIC],
2268 double t[N_SYMMETRIC],
2269 double somers_d_v[3], double somers_d_ase[3],
2270 double somers_d_t[3])
2274 q = MIN (pt->ns_rows, pt->ns_cols);
2278 for (i = 0; i < N_SYMMETRIC; i++)
2279 v[i] = ase[i] = t[i] = SYSMIS;
2281 /* Phi, Cramer's V, contingency coefficient. */
2282 if (proc->statistics & ((1u << CRS_ST_PHI) | (1u << CRS_ST_CC)))
2284 double Xp = 0.; /* Pearson chi-square. */
2287 for (r = 0; r < pt->n_rows; r++)
2288 for (c = 0; c < pt->n_cols; c++)
2290 const double expected = pt->row_tot[r] * pt->col_tot[c] / pt->total;
2291 const double freq = pt->mat[pt->n_cols * r + c];
2292 const double residual = freq - expected;
2294 Xp += residual * residual / expected;
2297 if (proc->statistics & (1u << CRS_ST_PHI))
2299 v[0] = sqrt (Xp / pt->total);
2300 v[1] = sqrt (Xp / (pt->total * (q - 1)));
2302 if (proc->statistics & (1u << CRS_ST_CC))
2303 v[2] = sqrt (Xp / (Xp + pt->total));
2306 if (proc->statistics & ((1u << CRS_ST_BTAU) | (1u << CRS_ST_CTAU)
2307 | (1u << CRS_ST_GAMMA) | (1u << CRS_ST_D)))
2312 double btau_cum, ctau_cum, gamma_cum, d_yx_cum, d_xy_cum;
2316 Dr = Dc = pow2 (pt->total);
2317 for (r = 0; r < pt->n_rows; r++)
2318 Dr -= pow2 (pt->row_tot[r]);
2319 for (c = 0; c < pt->n_cols; c++)
2320 Dc -= pow2 (pt->col_tot[c]);
2322 cum = xnmalloc (pt->n_cols * pt->n_rows, sizeof *cum);
2323 for (c = 0; c < pt->n_cols; c++)
2327 for (r = 0; r < pt->n_rows; r++)
2328 cum[c + r * pt->n_cols] = ct += pt->mat[c + r * pt->n_cols];
2337 for (i = 0; i < pt->n_rows; i++)
2341 for (j = 1; j < pt->n_cols; j++)
2342 Cij += pt->col_tot[j] - cum[j + i * pt->n_cols];
2345 for (j = 1; j < pt->n_cols; j++)
2346 Dij += cum[j + (i - 1) * pt->n_cols];
2350 double fij = pt->mat[j + i * pt->n_cols];
2354 if (++j == pt->n_cols)
2356 assert (j < pt->n_cols);
2358 Cij -= pt->col_tot[j] - cum[j + i * pt->n_cols];
2359 Dij += pt->col_tot[j - 1] - cum[j - 1 + i * pt->n_cols];
2363 Cij += cum[j - 1 + (i - 1) * pt->n_cols];
2364 Dij -= cum[j + (i - 1) * pt->n_cols];
2370 if (proc->statistics & (1u << CRS_ST_BTAU))
2371 v[3] = (P - Q) / sqrt (Dr * Dc);
2372 if (proc->statistics & (1u << CRS_ST_CTAU))
2373 v[4] = (q * (P - Q)) / (pow2 (pt->total) * (q - 1));
2374 if (proc->statistics & (1u << CRS_ST_GAMMA))
2375 v[5] = (P - Q) / (P + Q);
2377 /* ASE for tau-b, tau-c, gamma. Calculations could be
2378 eliminated here, at expense of memory. */
2383 btau_cum = ctau_cum = gamma_cum = d_yx_cum = d_xy_cum = 0.;
2384 for (i = 0; i < pt->n_rows; i++)
2388 for (j = 1; j < pt->n_cols; j++)
2389 Cij += pt->col_tot[j] - cum[j + i * pt->n_cols];
2392 for (j = 1; j < pt->n_cols; j++)
2393 Dij += cum[j + (i - 1) * pt->n_cols];
2397 double fij = pt->mat[j + i * pt->n_cols];
2399 if (proc->statistics & (1u << CRS_ST_BTAU))
2401 const double temp = (2. * sqrt (Dr * Dc) * (Cij - Dij)
2402 + v[3] * (pt->row_tot[i] * Dc
2403 + pt->col_tot[j] * Dr));
2404 btau_cum += fij * temp * temp;
2408 const double temp = Cij - Dij;
2409 ctau_cum += fij * temp * temp;
2412 if (proc->statistics & (1u << CRS_ST_GAMMA))
2414 const double temp = Q * Cij - P * Dij;
2415 gamma_cum += fij * temp * temp;
2418 if (proc->statistics & (1u << CRS_ST_D))
2420 d_yx_cum += fij * pow2 (Dr * (Cij - Dij)
2421 - (P - Q) * (pt->total - pt->row_tot[i]));
2422 d_xy_cum += fij * pow2 (Dc * (Dij - Cij)
2423 - (Q - P) * (pt->total - pt->col_tot[j]));
2426 if (++j == pt->n_cols)
2428 assert (j < pt->n_cols);
2430 Cij -= pt->col_tot[j] - cum[j + i * pt->n_cols];
2431 Dij += pt->col_tot[j - 1] - cum[j - 1 + i * pt->n_cols];
2435 Cij += cum[j - 1 + (i - 1) * pt->n_cols];
2436 Dij -= cum[j + (i - 1) * pt->n_cols];
2442 btau_var = ((btau_cum
2443 - (pt->total * pow2 (pt->total * (P - Q) / sqrt (Dr * Dc) * (Dr + Dc))))
2445 if (proc->statistics & (1u << CRS_ST_BTAU))
2447 ase[3] = sqrt (btau_var);
2448 t[3] = v[3] / (2 * sqrt ((ctau_cum - (P - Q) * (P - Q) / pt->total)
2451 if (proc->statistics & (1u << CRS_ST_CTAU))
2453 ase[4] = ((2 * q / ((q - 1) * pow2 (pt->total)))
2454 * sqrt (ctau_cum - (P - Q) * (P - Q) / pt->total));
2455 t[4] = v[4] / ase[4];
2457 if (proc->statistics & (1u << CRS_ST_GAMMA))
2459 ase[5] = ((4. / ((P + Q) * (P + Q))) * sqrt (gamma_cum));
2460 t[5] = v[5] / (2. / (P + Q)
2461 * sqrt (ctau_cum - (P - Q) * (P - Q) / pt->total));
2463 if (proc->statistics & (1u << CRS_ST_D))
2465 somers_d_v[0] = (P - Q) / (.5 * (Dc + Dr));
2466 somers_d_ase[0] = 2. * btau_var / (Dr + Dc) * sqrt (Dr * Dc);
2467 somers_d_t[0] = (somers_d_v[0]
2469 * sqrt (ctau_cum - pow2 (P - Q) / pt->total)));
2470 somers_d_v[1] = (P - Q) / Dc;
2471 somers_d_ase[1] = 2. / pow2 (Dc) * sqrt (d_xy_cum);
2472 somers_d_t[1] = (somers_d_v[1]
2474 * sqrt (ctau_cum - pow2 (P - Q) / pt->total)));
2475 somers_d_v[2] = (P - Q) / Dr;
2476 somers_d_ase[2] = 2. / pow2 (Dr) * sqrt (d_yx_cum);
2477 somers_d_t[2] = (somers_d_v[2]
2479 * sqrt (ctau_cum - pow2 (P - Q) / pt->total)));
2485 /* Spearman correlation, Pearson's r. */
2486 if (proc->statistics & (1u << CRS_ST_CORR))
2488 double *R = xmalloc (sizeof *R * pt->n_rows);
2489 double *C = xmalloc (sizeof *C * pt->n_cols);
2492 double y, t, c = 0., s = 0.;
2497 R[i] = s + (pt->row_tot[i] + 1.) / 2.;
2498 y = pt->row_tot[i] - c;
2502 if (++i == pt->n_rows)
2504 assert (i < pt->n_rows);
2509 double y, t, c = 0., s = 0.;
2514 C[j] = s + (pt->col_tot[j] + 1.) / 2;
2515 y = pt->col_tot[j] - c;
2519 if (++j == pt->n_cols)
2521 assert (j < pt->n_cols);
2525 calc_r (pt, R, C, &v[6], &t[6], &ase[6]);
2531 calc_r (pt, (double *) pt->rows, (double *) pt->cols, &v[7], &t[7], &ase[7]);
2535 /* Cohen's kappa. */
2536 if (proc->statistics & (1u << CRS_ST_KAPPA) && pt->ns_rows == pt->ns_cols)
2538 double sum_fii, sum_rici, sum_fiiri_ci, sum_fijri_ci2, sum_riciri_ci;
2541 for (sum_fii = sum_rici = sum_fiiri_ci = sum_riciri_ci = 0., i = j = 0;
2542 i < pt->ns_rows; i++, j++)
2546 while (pt->col_tot[j] == 0.)
2549 prod = pt->row_tot[i] * pt->col_tot[j];
2550 sum = pt->row_tot[i] + pt->col_tot[j];
2552 sum_fii += pt->mat[j + i * pt->n_cols];
2554 sum_fiiri_ci += pt->mat[j + i * pt->n_cols] * sum;
2555 sum_riciri_ci += prod * sum;
2557 for (sum_fijri_ci2 = 0., i = 0; i < pt->ns_rows; i++)
2558 for (j = 0; j < pt->ns_cols; j++)
2560 double sum = pt->row_tot[i] + pt->col_tot[j];
2561 sum_fijri_ci2 += pt->mat[j + i * pt->n_cols] * sum * sum;
2564 v[8] = (pt->total * sum_fii - sum_rici) / (pow2 (pt->total) - sum_rici);
2566 ase[8] = sqrt ((pow2 (pt->total) * sum_rici
2567 + sum_rici * sum_rici
2568 - pt->total * sum_riciri_ci)
2569 / (pt->total * (pow2 (pt->total) - sum_rici) * (pow2 (pt->total) - sum_rici)));
2571 t[8] = v[8] / sqrt (pt->total * (((sum_fii * (pt->total - sum_fii))
2572 / pow2 (pow2 (pt->total) - sum_rici))
2573 + ((2. * (pt->total - sum_fii)
2574 * (2. * sum_fii * sum_rici
2575 - pt->total * sum_fiiri_ci))
2576 / cube (pow2 (pt->total) - sum_rici))
2577 + (pow2 (pt->total - sum_fii)
2578 * (pt->total * sum_fijri_ci2 - 4.
2579 * sum_rici * sum_rici)
2580 / pow4 (pow2 (pt->total) - sum_rici))));
2582 t[8] = v[8] / ase[8];
2589 /* Calculate risk estimate. */
2591 calc_risk (struct pivot_table *pt,
2592 double *value, double *upper, double *lower, union value *c)
2594 double f11, f12, f21, f22;
2600 for (i = 0; i < 3; i++)
2601 value[i] = upper[i] = lower[i] = SYSMIS;
2604 if (pt->ns_rows != 2 || pt->ns_cols != 2)
2611 for (i = j = 0; i < pt->n_cols; i++)
2612 if (pt->col_tot[i] != 0.)
2621 f11 = pt->mat[nz_cols[0]];
2622 f12 = pt->mat[nz_cols[1]];
2623 f21 = pt->mat[nz_cols[0] + pt->n_cols];
2624 f22 = pt->mat[nz_cols[1] + pt->n_cols];
2626 c[0] = pt->cols[nz_cols[0]];
2627 c[1] = pt->cols[nz_cols[1]];
2630 value[0] = (f11 * f22) / (f12 * f21);
2631 v = sqrt (1. / f11 + 1. / f12 + 1. / f21 + 1. / f22);
2632 lower[0] = value[0] * exp (-1.960 * v);
2633 upper[0] = value[0] * exp (1.960 * v);
2635 value[1] = (f11 * (f21 + f22)) / (f21 * (f11 + f12));
2636 v = sqrt ((f12 / (f11 * (f11 + f12)))
2637 + (f22 / (f21 * (f21 + f22))));
2638 lower[1] = value[1] * exp (-1.960 * v);
2639 upper[1] = value[1] * exp (1.960 * v);
2641 value[2] = (f12 * (f21 + f22)) / (f22 * (f11 + f12));
2642 v = sqrt ((f11 / (f12 * (f11 + f12)))
2643 + (f21 / (f22 * (f21 + f22))));
2644 lower[2] = value[2] * exp (-1.960 * v);
2645 upper[2] = value[2] * exp (1.960 * v);
2650 /* Calculate directional measures. */
2652 calc_directional (struct crosstabs_proc *proc, struct pivot_table *pt,
2653 double v[N_DIRECTIONAL], double ase[N_DIRECTIONAL],
2654 double t[N_DIRECTIONAL])
2659 for (i = 0; i < N_DIRECTIONAL; i++)
2660 v[i] = ase[i] = t[i] = SYSMIS;
2664 if (proc->statistics & (1u << CRS_ST_LAMBDA))
2666 double *fim = xnmalloc (pt->n_rows, sizeof *fim);
2667 int *fim_index = xnmalloc (pt->n_rows, sizeof *fim_index);
2668 double *fmj = xnmalloc (pt->n_cols, sizeof *fmj);
2669 int *fmj_index = xnmalloc (pt->n_cols, sizeof *fmj_index);
2670 double sum_fim, sum_fmj;
2672 int rm_index, cm_index;
2675 /* Find maximum for each row and their sum. */
2676 for (sum_fim = 0., i = 0; i < pt->n_rows; i++)
2678 double max = pt->mat[i * pt->n_cols];
2681 for (j = 1; j < pt->n_cols; j++)
2682 if (pt->mat[j + i * pt->n_cols] > max)
2684 max = pt->mat[j + i * pt->n_cols];
2688 sum_fim += fim[i] = max;
2689 fim_index[i] = index;
2692 /* Find maximum for each column. */
2693 for (sum_fmj = 0., j = 0; j < pt->n_cols; j++)
2695 double max = pt->mat[j];
2698 for (i = 1; i < pt->n_rows; i++)
2699 if (pt->mat[j + i * pt->n_cols] > max)
2701 max = pt->mat[j + i * pt->n_cols];
2705 sum_fmj += fmj[j] = max;
2706 fmj_index[j] = index;
2709 /* Find maximum row total. */
2710 rm = pt->row_tot[0];
2712 for (i = 1; i < pt->n_rows; i++)
2713 if (pt->row_tot[i] > rm)
2715 rm = pt->row_tot[i];
2719 /* Find maximum column total. */
2720 cm = pt->col_tot[0];
2722 for (j = 1; j < pt->n_cols; j++)
2723 if (pt->col_tot[j] > cm)
2725 cm = pt->col_tot[j];
2729 v[0] = (sum_fim + sum_fmj - cm - rm) / (2. * pt->total - rm - cm);
2730 v[1] = (sum_fmj - rm) / (pt->total - rm);
2731 v[2] = (sum_fim - cm) / (pt->total - cm);
2733 /* ASE1 for Y given PT. */
2737 for (accum = 0., i = 0; i < pt->n_rows; i++)
2738 for (j = 0; j < pt->n_cols; j++)
2740 const int deltaj = j == cm_index;
2741 accum += (pt->mat[j + i * pt->n_cols]
2742 * pow2 ((j == fim_index[i])
2747 ase[2] = sqrt (accum - pt->total * v[0]) / (pt->total - cm);
2750 /* ASE0 for Y given PT. */
2754 for (accum = 0., i = 0; i < pt->n_rows; i++)
2755 if (cm_index != fim_index[i])
2756 accum += (pt->mat[i * pt->n_cols + fim_index[i]]
2757 + pt->mat[i * pt->n_cols + cm_index]);
2758 t[2] = v[2] / (sqrt (accum - pow2 (sum_fim - cm) / pt->total) / (pt->total - cm));
2761 /* ASE1 for PT given Y. */
2765 for (accum = 0., i = 0; i < pt->n_rows; i++)
2766 for (j = 0; j < pt->n_cols; j++)
2768 const int deltaj = i == rm_index;
2769 accum += (pt->mat[j + i * pt->n_cols]
2770 * pow2 ((i == fmj_index[j])
2775 ase[1] = sqrt (accum - pt->total * v[0]) / (pt->total - rm);
2778 /* ASE0 for PT given Y. */
2782 for (accum = 0., j = 0; j < pt->n_cols; j++)
2783 if (rm_index != fmj_index[j])
2784 accum += (pt->mat[j + pt->n_cols * fmj_index[j]]
2785 + pt->mat[j + pt->n_cols * rm_index]);
2786 t[1] = v[1] / (sqrt (accum - pow2 (sum_fmj - rm) / pt->total) / (pt->total - rm));
2789 /* Symmetric ASE0 and ASE1. */
2794 for (accum0 = accum1 = 0., i = 0; i < pt->n_rows; i++)
2795 for (j = 0; j < pt->n_cols; j++)
2797 int temp0 = (fmj_index[j] == i) + (fim_index[i] == j);
2798 int temp1 = (i == rm_index) + (j == cm_index);
2799 accum0 += pt->mat[j + i * pt->n_cols] * pow2 (temp0 - temp1);
2800 accum1 += (pt->mat[j + i * pt->n_cols]
2801 * pow2 (temp0 + (v[0] - 1.) * temp1));
2803 ase[0] = sqrt (accum1 - 4. * pt->total * v[0] * v[0]) / (2. * pt->total - rm - cm);
2804 t[0] = v[0] / (sqrt (accum0 - pow2 ((sum_fim + sum_fmj - cm - rm) / pt->total))
2805 / (2. * pt->total - rm - cm));
2814 double sum_fij2_ri, sum_fij2_ci;
2815 double sum_ri2, sum_cj2;
2817 for (sum_fij2_ri = sum_fij2_ci = 0., i = 0; i < pt->n_rows; i++)
2818 for (j = 0; j < pt->n_cols; j++)
2820 double temp = pow2 (pt->mat[j + i * pt->n_cols]);
2821 sum_fij2_ri += temp / pt->row_tot[i];
2822 sum_fij2_ci += temp / pt->col_tot[j];
2825 for (sum_ri2 = 0., i = 0; i < pt->n_rows; i++)
2826 sum_ri2 += pow2 (pt->row_tot[i]);
2828 for (sum_cj2 = 0., j = 0; j < pt->n_cols; j++)
2829 sum_cj2 += pow2 (pt->col_tot[j]);
2831 v[3] = (pt->total * sum_fij2_ci - sum_ri2) / (pow2 (pt->total) - sum_ri2);
2832 v[4] = (pt->total * sum_fij2_ri - sum_cj2) / (pow2 (pt->total) - sum_cj2);
2836 if (proc->statistics & (1u << CRS_ST_UC))
2838 double UX, UY, UXY, P;
2839 double ase1_yx, ase1_xy, ase1_sym;
2842 for (UX = 0., i = 0; i < pt->n_rows; i++)
2843 if (pt->row_tot[i] > 0.)
2844 UX -= pt->row_tot[i] / pt->total * log (pt->row_tot[i] / pt->total);
2846 for (UY = 0., j = 0; j < pt->n_cols; j++)
2847 if (pt->col_tot[j] > 0.)
2848 UY -= pt->col_tot[j] / pt->total * log (pt->col_tot[j] / pt->total);
2850 for (UXY = P = 0., i = 0; i < pt->n_rows; i++)
2851 for (j = 0; j < pt->n_cols; j++)
2853 double entry = pt->mat[j + i * pt->n_cols];
2858 P += entry * pow2 (log (pt->col_tot[j] * pt->row_tot[i] / (pt->total * entry)));
2859 UXY -= entry / pt->total * log (entry / pt->total);
2862 for (ase1_yx = ase1_xy = ase1_sym = 0., i = 0; i < pt->n_rows; i++)
2863 for (j = 0; j < pt->n_cols; j++)
2865 double entry = pt->mat[j + i * pt->n_cols];
2870 ase1_yx += entry * pow2 (UY * log (entry / pt->row_tot[i])
2871 + (UX - UXY) * log (pt->col_tot[j] / pt->total));
2872 ase1_xy += entry * pow2 (UX * log (entry / pt->col_tot[j])
2873 + (UY - UXY) * log (pt->row_tot[i] / pt->total));
2874 ase1_sym += entry * pow2 ((UXY
2875 * log (pt->row_tot[i] * pt->col_tot[j] / pow2 (pt->total)))
2876 - (UX + UY) * log (entry / pt->total));
2879 v[5] = 2. * ((UX + UY - UXY) / (UX + UY));
2880 ase[5] = (2. / (pt->total * pow2 (UX + UY))) * sqrt (ase1_sym);
2881 t[5] = v[5] / ((2. / (pt->total * (UX + UY)))
2882 * sqrt (P - pow2 (UX + UY - UXY) / pt->total));
2884 v[6] = (UX + UY - UXY) / UX;
2885 ase[6] = sqrt (ase1_xy) / (pt->total * UX * UX);
2886 t[6] = v[6] / (sqrt (P - pt->total * pow2 (UX + UY - UXY)) / (pt->total * UX));
2888 v[7] = (UX + UY - UXY) / UY;
2889 ase[7] = sqrt (ase1_yx) / (pt->total * UY * UY);
2890 t[7] = v[7] / (sqrt (P - pt->total * pow2 (UX + UY - UXY)) / (pt->total * UY));
2894 if (proc->statistics & (1u << CRS_ST_D))
2896 double v_dummy[N_SYMMETRIC];
2897 double ase_dummy[N_SYMMETRIC];
2898 double t_dummy[N_SYMMETRIC];
2899 double somers_d_v[3];
2900 double somers_d_ase[3];
2901 double somers_d_t[3];
2903 if (calc_symmetric (proc, pt, v_dummy, ase_dummy, t_dummy,
2904 somers_d_v, somers_d_ase, somers_d_t))
2907 for (i = 0; i < 3; i++)
2909 v[8 + i] = somers_d_v[i];
2910 ase[8 + i] = somers_d_ase[i];
2911 t[8 + i] = somers_d_t[i];
2917 if (proc->statistics & (1u << CRS_ST_ETA))
2920 double sum_Xr, sum_X2r;
2924 for (sum_Xr = sum_X2r = 0., i = 0; i < pt->n_rows; i++)
2926 sum_Xr += pt->rows[i].f * pt->row_tot[i];
2927 sum_X2r += pow2 (pt->rows[i].f) * pt->row_tot[i];
2929 SX = sum_X2r - pow2 (sum_Xr) / pt->total;
2931 for (SXW = 0., j = 0; j < pt->n_cols; j++)
2935 for (cum = 0., i = 0; i < pt->n_rows; i++)
2937 SXW += pow2 (pt->rows[i].f) * pt->mat[j + i * pt->n_cols];
2938 cum += pt->rows[i].f * pt->mat[j + i * pt->n_cols];
2941 SXW -= cum * cum / pt->col_tot[j];
2943 v[11] = sqrt (1. - SXW / SX);
2947 double sum_Yc, sum_Y2c;
2951 for (sum_Yc = sum_Y2c = 0., i = 0; i < pt->n_cols; i++)
2953 sum_Yc += pt->cols[i].f * pt->col_tot[i];
2954 sum_Y2c += pow2 (pt->cols[i].f) * pt->col_tot[i];
2956 SY = sum_Y2c - sum_Yc * sum_Yc / pt->total;
2958 for (SYW = 0., i = 0; i < pt->n_rows; i++)
2962 for (cum = 0., j = 0; j < pt->n_cols; j++)
2964 SYW += pow2 (pt->cols[j].f) * pt->mat[j + i * pt->n_cols];
2965 cum += pt->cols[j].f * pt->mat[j + i * pt->n_cols];
2968 SYW -= cum * cum / pt->row_tot[i];
2970 v[12] = sqrt (1. - SYW / SY);