Adopt C99 bool in the tree234 API.

The only affected function here is splitpos234, which I don't think
these puzzles are even using at the moment.
This commit is contained in:
Simon Tatham
2018-11-13 21:41:45 +00:00
parent 836a5c4ea7
commit 33b55db48e
3 changed files with 6 additions and 4 deletions

View File

@ -4044,13 +4044,13 @@ Returns the number of elements currently in the tree.
\S{utils-splitpos234} \cw{splitpos234()}
\c tree234 *splitpos234(tree234 *t, int index, int before);
\c tree234 *splitpos234(tree234 *t, int index, bool before);
Splits the input tree into two pieces at a given position, and
creates a new tree containing all the elements on one side of that
position.
If \c{before} is \cw{TRUE}, then all the items at or after position
If \c{before} is \cw{true}, then all the items at or after position
\c{index} are left in the input tree, and the items before that
point are returned in the new tree. Otherwise, the reverse happens:
all the items at or after \c{index} are moved into the new tree, and

View File

@ -1376,7 +1376,7 @@ static node234 *split234_internal(tree234 *t, int index) {
t->root = halves[1];
return halves[0];
}
tree234 *splitpos234(tree234 *t, int index, int before) {
tree234 *splitpos234(tree234 *t, int index, bool before) {
tree234 *ret;
node234 *n;
int count;

View File

@ -28,6 +28,8 @@
#ifndef TREE234_H
#define TREE234_H
#include <stdbool.h>
/*
* This typedef is opaque outside tree234.c itself.
*/
@ -172,7 +174,7 @@ int count234(tree234 *t);
* in the tree that satisfy the relation are returned; the
* remainder are left.
*/
tree234 *splitpos234(tree234 *t, int index, int before);
tree234 *splitpos234(tree234 *t, int index, bool before);
tree234 *split234(tree234 *t, void *e, cmpfn234 cmp, int rel);
/*