--- /dev/null
+/* PSPP - a program for statistical analysis.
+ Copyright (C) 1997-9, 2000, 2009-2011 Free Software Foundation, Inc.
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
+
+#include <config.h>
+
+#include <gsl/gsl_rng.h>
+#include <limits.h>
+#include <stdio.h>
+#include <math.h>
+
+#include "data/dataset.h"
+#include "data/variable.h"
+#include "language/command.h"
+#include "language/lexer/lexer.h"
+#include "libpspp/compiler.h"
+#include "libpspp/message.h"
+#include "libpspp/str.h"
+#include "math/random.h"
+
+#include "gl/xalloc.h"
+
+#include "gettext.h"
+#define _(msgid) gettext (msgid)
+
+/* The two different types of samples. */
+enum
+ {
+ TYPE_A_FROM_B, /* 5 FROM 10 */
+ TYPE_FRACTION /* 0.5 */
+ };
+
+/* SAMPLE transformation. */
+struct sample_trns
+ {
+ int type; /* One of TYPE_*. */
+ int n, N; /* TYPE_A_FROM_B: n from N. */
+ int m, t; /* TYPE_A_FROM_B: # picked so far; # so far. */
+ unsigned frac; /* TYPE_FRACTION: a fraction of UINT_MAX. */
+ };
+
+static const struct trns_class sample_trns_class;
+
+int
+cmd_sample (struct lexer *lexer, struct dataset *ds)
+{
+ struct sample_trns *trns;
+
+ int type;
+ int a, b;
+ unsigned frac;
+
+ if (!lex_force_num (lexer))
+ return CMD_FAILURE;
+ if (!lex_is_integer (lexer))
+ {
+ unsigned long min = gsl_rng_min (get_rng ());
+ unsigned long max = gsl_rng_max (get_rng ());
+
+ type = TYPE_FRACTION;
+ if (!lex_force_num_range_open (lexer, "SAMPLE", 0, 1))
+ return CMD_FAILURE;
+
+ frac = lex_tokval (lexer) * (max - min) + min;
+ a = b = 0;
+ }
+ else
+ {
+ type = TYPE_A_FROM_B;
+ a = lex_integer (lexer);
+ lex_get (lexer);
+ if (!lex_force_match_id (lexer, "FROM"))
+ return CMD_FAILURE;
+ if (!lex_force_int_range (lexer, "FROM", a + 1, INT_MAX))
+ return CMD_FAILURE;
+ b = lex_integer (lexer);
+ frac = 0;
+ }
+ lex_get (lexer);
+
+ trns = xmalloc (sizeof *trns);
+ trns->type = type;
+ trns->n = a;
+ trns->N = b;
+ trns->m = trns->t = 0;
+ trns->frac = frac;
+ add_transformation (ds, &sample_trns_class, trns);
+
+ return CMD_SUCCESS;
+}
+
+/* Executes a SAMPLE transformation. */
+static enum trns_result
+sample_trns_proc (void *t_, struct ccase **c UNUSED,
+ casenumber case_num UNUSED)
+{
+ struct sample_trns *t = t_;
+ double U;
+
+ if (t->type == TYPE_FRACTION)
+ {
+ if (gsl_rng_get (get_rng ()) <= t->frac)
+ return TRNS_CONTINUE;
+ else
+ return TRNS_DROP_CASE;
+ }
+
+ if (t->m >= t->n)
+ return TRNS_DROP_CASE;
+
+ U = gsl_rng_uniform (get_rng ());
+ if ((t->N - t->t) * U >= t->n - t->m)
+ {
+ t->t++;
+ return TRNS_DROP_CASE;
+ }
+ else
+ {
+ t->m++;
+ t->t++;
+ return TRNS_CONTINUE;
+ }
+}
+
+static bool
+sample_trns_free (void *t_)
+{
+ struct sample_trns *t = t_;
+ free (t);
+ return true;
+}
+
+static const struct trns_class sample_trns_class = {
+ .name = "SAMPLE",
+ .execute = sample_trns_proc,
+ .destroy = sample_trns_free,
+};