1 /* PSPP - a program for statistical analysis.
2 Copyright (C) 2006 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/>. */
18 #include <libpspp/compiler.h>
19 #include <output/table.h>
20 #include <libpspp/alloc.h>
22 #include <data/case.h>
23 #include <data/casereader.h>
24 #include <data/dictionary.h>
25 #include <data/procedure.h>
26 #include <data/variable.h>
27 #include <data/value.h>
28 #include <data/value-labels.h>
30 #include <libpspp/message.h>
31 #include <libpspp/assertion.h>
37 #define _(msgid) gettext (msgid)
39 #include <libpspp/misc.h>
41 #include <gsl/gsl_cdf.h>
42 #include <gsl/gsl_randist.h>
43 #include <gsl-extras/gsl-extras.h>
47 #include <libpspp/hash.h>
49 static double calculate_binomial_internal (double n1, double n2,
54 swap (double *i1, double *i2)
62 calculate_binomial (double n1, double n2, double p)
64 const double n = n1 + n2;
65 const bool test_reversed = (n1 / n > p ) ;
72 return calculate_binomial_internal (n1, n2, p);
76 calculate_binomial_internal (double n1, double n2, double p)
78 /* SPSS Statistical Algorithms has completely different and WRONG
81 double sig1tailed = gslextras_cdf_binomial_P (n1, n1 + n2, p);
84 return sig1tailed > 0.5 ? 1.0 :sig1tailed * 2.0;
90 do_binomial (const struct dictionary *dict,
91 struct casereader *input,
92 const struct binomial_test *bst,
93 struct freq_mutable *cat1,
94 struct freq_mutable *cat2,
100 const struct one_sample_test *ost = (const struct one_sample_test *) bst;
103 while (casereader_read(input, &c))
106 double w = dict_get_case_weight (dict, &c, &warn);
108 for (v = 0 ; v < ost->n_vars ; ++v )
110 const struct variable *var = ost->vars[v];
111 const union value *value = case_data (&c, var);
112 int width = var_get_width (var);
114 if (var_is_value_missing (var, value, exclude))
117 if ( NULL == cat1[v].value )
119 cat1[v].value = value_dup (value, width);
122 else if ( 0 == compare_values (cat1[v].value, value, width))
124 else if ( NULL == cat2[v].value )
126 cat2[v].value = value_dup (value, width);
129 else if ( 0 == compare_values (cat2[v].value, value, width))
131 else if ( bst->category1 == SYSMIS)
132 msg (ME, _("Variable %s is not dichotomous"), var_get_name (var));
137 return casereader_destroy (input);
143 binomial_execute (const struct dataset *ds,
144 struct casereader *input,
145 enum mv_class exclude,
146 const struct npar_test *test)
149 const struct binomial_test *bst = (const struct binomial_test *) test;
150 const struct one_sample_test *ost = (const struct one_sample_test*) test;
152 struct freq_mutable *cat1 = xzalloc (sizeof (*cat1) * ost->n_vars);
153 struct freq_mutable *cat2 = xzalloc (sizeof (*cat1) * ost->n_vars);
155 assert ((bst->category1 == SYSMIS) == (bst->category2 == SYSMIS) );
157 if ( bst->category1 != SYSMIS )
160 v.f = bst->category1;
161 cat1->value = value_dup (&v, 0);
164 if ( bst->category2 != SYSMIS )
167 v.f = bst->category2;
168 cat2->value = value_dup (&v, 0);
171 if (do_binomial (dataset_dict(ds), input, bst, cat1, cat2, exclude))
173 struct tab_table *table = tab_create (7, ost->n_vars * 3 + 1, 0);
175 tab_dim (table, tab_natural_dimensions);
177 tab_title (table, _("Binomial Test"));
179 tab_headers (table, 2, 0, 1, 0);
181 tab_box (table, TAL_1, TAL_1, -1, TAL_1,
182 0, 0, table->nc - 1, tab_nr(table) - 1 );
184 for (v = 0 ; v < ost->n_vars; ++v)
187 const struct variable *var = ost->vars[v];
188 tab_hline (table, TAL_1, 0, tab_nc (table) -1, 1 + v * 3);
191 tab_text (table, 0, 1 + v * 3, TAB_LEFT, var_to_string (var));
192 tab_text (table, 1, 1 + v * 3, TAB_LEFT, _("Group1"));
193 tab_text (table, 1, 2 + v * 3, TAB_LEFT, _("Group2"));
194 tab_text (table, 1, 3 + v * 3, TAB_LEFT, _("Total"));
197 tab_float (table, 5, 1 + v * 3, TAB_NONE, bst->p, 8, 3);
199 /* Category labels */
200 tab_text (table, 2, 1 + v * 3, TAB_NONE,
201 var_get_value_name (var, cat1[v].value));
202 tab_text (table, 2, 2 + v * 3, TAB_NONE,
203 var_get_value_name (var, cat2[v].value));
206 tab_float (table, 3, 1 + v * 3, TAB_NONE, cat1[v].count, 8, 0);
207 tab_float (table, 3, 2 + v * 3, TAB_NONE, cat2[v].count, 8, 0);
209 n_total = cat1[v].count + cat2[v].count;
210 tab_float (table, 3, 3 + v * 3, TAB_NONE, n_total, 8, 0);
212 /* Observed Proportions */
213 tab_float (table, 4, 1 + v * 3, TAB_NONE,
214 cat1[v].count / n_total, 8, 3);
215 tab_float (table, 4, 2 + v * 3, TAB_NONE,
216 cat2[v].count / n_total, 8, 3);
217 tab_float (table, 4, 3 + v * 3, TAB_NONE,
218 (cat1[v].count + cat2[v].count) / n_total, 8, 2);
221 sig = calculate_binomial (cat1[v].count, cat2[v].count, bst->p);
222 tab_float (table, 6, 1 + v * 3, TAB_NONE, sig, 8, 3);
225 tab_text (table, 2, 0, TAB_CENTER, _("Category"));
226 tab_text (table, 3, 0, TAB_CENTER, _("N"));
227 tab_text (table, 4, 0, TAB_CENTER, _("Observed Prop."));
228 tab_text (table, 5, 0, TAB_CENTER, _("Test Prop."));
230 tab_text (table, 6, 0, TAB_CENTER | TAT_PRINTF,
231 _("Exact Sig. (%d-tailed)"),
232 bst->p == 0.5 ? 2: 1);
234 tab_vline (table, TAL_2, 2, 0, tab_nr (table) -1);
238 for (v = 0; v < ost->n_vars; v++)
240 free (cat1[v].value);
241 free (cat2[v].value);