-/* PSPP - computes sample statistics.
- Copyright (C) 2007 Free Software Foundation, Inc.
+/* PSPP - a program for statistical analysis.
+ Copyright (C) 2007, 2009 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/>. */
/* Bitmap, implemented as a balanced binary tree. */
return true;
}
+/* Scans RS for and deletes the first contiguous run of REQUEST
+ 1-bits. If successful, sets *START to the position of the
+ first 1-bit deleted and returns true If RS does not contain a
+ run of REQUEST or more contiguous 1-bits, returns false and
+ does not modify RS. */
+bool
+range_set_allocate_fully (struct range_set *rs, unsigned long int request,
+ unsigned long int *start)
+{
+ struct range_set_node *node;
+
+ assert (request > 0);
+
+ for (node = first_node (rs); node != NULL; node = next_node (rs, node))
+ {
+ unsigned long int node_width = node->end - node->start;
+ if (node_width >= request)
+ {
+ *start = node->start;
+ if (node_width > request)
+ node->start += request;
+ else
+ delete_node (rs, node);
+ rs->cache_end = 0;
+ return true;
+ }
+ }
+ return false;
+}
+
/* Returns true if there is a 1-bit at the given POSITION in RS,
false otherwise. */
bool