-/* PSPP - computes sample statistics.
+/* PSPP - a program for statistical analysis.
Copyright (C) 2006 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 2 of the
- License, or (at your option) any later version.
+ 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.
+ 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, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
- 02110-1301, USA. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* Circular doubly linked lists.
Here's an example of iteration from head to tail:
struct llx *llx;
- for (llx = llx_head (&list); llx != llx_null (&list);
+ for (llx = llx_head (&list); llx != llx_null (&list);
llx = llx_next (llx))
{
struct foo *foo = llx_data (llx);
};
/* Memory manager. */
-struct llx_manager
+struct llx_manager
{
/* Allocates and returns memory for a new struct llx.
If space is unavailable, returns a null pointer. */
struct llx *llx_min (const struct llx *r0, const struct llx *r1,
llx_compare_func *, void *aux);
int llx_lexicographical_compare_3way (const struct llx *a0,
- const struct llx *a1,
+ const struct llx *a1,
const struct llx *b0,
- const struct llx *b1,
+ const struct llx *b1,
llx_compare_func *, void *aux);
/* Mutating algorithms. */
/* Returns the llx within which LL is embedded. */
static struct llx *
-llx_from_ll (struct ll *ll)
+llx_from_ll (struct ll *ll)
{
return ll_data (ll, struct llx, ll);
}
/* Initializes LIST as an empty list. */
static inline void
-llx_init (struct llx_list *list)
+llx_init (struct llx_list *list)
{
ll_init (&list->ll_list);
}
false if LIST is not empty (has at least one other node).
Executes in O(1) time. */
static inline bool
-llx_is_empty (const struct llx_list *list)
+llx_is_empty (const struct llx_list *list)
{
return ll_is_empty (&list->ll_list);
}
/* Returns the first node in LIST,
or the null node if LIST is empty. */
static inline struct llx *
-llx_head (const struct llx_list *list)
+llx_head (const struct llx_list *list)
{
return llx_from_ll (ll_head (&list->ll_list));
}
/* Returns the last node in LIST,
or the null node if LIST is empty. */
static inline struct llx *
-llx_tail (const struct llx_list *list)
+llx_tail (const struct llx_list *list)
{
return llx_from_ll (ll_tail (&list->ll_list));
}
/* Returns LIST's null node. */
static inline struct llx *
-llx_null (const struct llx_list *list)
+llx_null (const struct llx_list *list)
{
return llx_from_ll (ll_null (&list->ll_list));
}
or the null node if LLX is at the end of its list.
(In an empty list, the null node follows itself.) */
static inline struct llx *
-llx_next (const struct llx *llx)
+llx_next (const struct llx *llx)
{
return llx_from_ll (ll_next (&llx->ll));
}
/* Returns the data in node LLX. */
static inline void *
-llx_data (const struct llx *llx)
+llx_data (const struct llx *llx)
{
return llx->data;
}