/* PSPP - a program for statistical analysis.
- Copyright (C) 2008 Free Software Foundation, Inc.
+ Copyright (C) 2008, 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
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <config.h>
-#include "extrema.h"
-#include <xalloc.h>
-#include <data/case.h>
-#include <data/val-type.h>
-#include <libpspp/compiler.h>
-#include <libpspp/ll.h>
+
+#include "math/extrema.h"
+
#include <stdlib.h>
+#include "data/case.h"
+#include "data/val-type.h"
+#include "libpspp/compiler.h"
+#include "libpspp/ll.h"
+
+#include "gl/xalloc.h"
+
struct extrema
{
size_t capacity;
const struct extremum *a = ll_data (a_, struct extremum, ll);
const struct extremum *b = ll_data (b_, struct extremum, ll);
- if ( a->value > b->value) return -1;
+ if (a->value > b->value) return -1;
return (a->value < b->value);
}
const struct extremum *a = ll_data (a_, struct extremum, ll);
const struct extremum *b = ll_data (b_, struct extremum, ll);
- if ( a->value < b->value) return -1;
+ if (a->value < b->value) return -1;
return (a->value > b->value);
}
struct extrema *extrema = xzalloc (sizeof *extrema);
extrema->capacity = n;
- if ( end == EXTREME_MAXIMA )
+ if (end == EXTREME_MAXIMA)
extrema->cmp_func = cmp_descending;
else
extrema->cmp_func = cmp_ascending;
e->location = location;
e->weight = weight;
- if ( val == SYSMIS)
+ if (val == SYSMIS)
{
free (e);
return;
ll_insert_ordered (ll_head (&extrema->list), ll_null (&extrema->list),
&e->ll, extrema->cmp_func, NULL);
- if ( extrema->n++ > extrema->capacity)
+ if (extrema->n++ > extrema->capacity)
{
struct ll *tail = ll_tail (&extrema->list);
struct extremum *et = ll_data (tail, struct extremum, ll);
{
const struct extremum *top;
- if ( ll_is_empty (&ex->list))
+ if (ll_is_empty (&ex->list))
return false;
top = (const struct extremum *)