Remove unused function psppire_sheet_cell_get_state

[pspp-builds.git] / src / libpspp / bt.h

diff --git a/src/libpspp/bt.h b/src/libpspp/bt.h
index 2a014aaf96f7eabbaefae9d9edc3a33b1a98f506..340b8760166c31fec29ea42ae8ecc50c24911806 100644 (file)
--- a/src/libpspp/bt.h
+++ b/src/libpspp/bt.h
@@ -1,20 +1,18 @@
-/* PSPP - computes sample statistics.
+/* PSPP - a program for statistical analysis.
    Copyright (C) 2007 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/>. */
 
 #ifndef LIBPSPP_BT_H
 #define LIBPSPP_BT_H 1
@@ -34,7 +32,7 @@
         ((STRUCT *) ((char *) (NODE) - offsetof (STRUCT, MEMBER)))
 
 /* Node in a balanced binary tree. */
-struct bt_node 
+struct bt_node
   {
     struct bt_node *up;        /* Parent (NULL for root). */
     struct bt_node *down[2];   /* Left child, right child. */
@@ -47,7 +45,7 @@ typedef int bt_compare_func (const struct bt_node *a,
                              const void *aux);
 
 /* A balanced binary tree. */
-struct bt 
+struct bt
   {
     struct bt_node *root;       /* Tree's root, NULL if empty. */
     bt_compare_func *compare;   /* To compare nodes. */
@@ -75,7 +73,7 @@ struct bt_node *bt_changed (struct bt *, struct bt_node *);
 void bt_moved (struct bt *, struct bt_node *);
 
 /* Returns the number of nodes currently in BT. */
-static inline size_t bt_count (const struct bt *bt) 
+static inline size_t bt_count (const struct bt *bt)
 {
   return bt->size;
 }