shithub: puzzles

Info  •  Files  •  Log  •  Branches

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.

--- a/devel.but

+++ b/devel.but

@@ -4044,13 +4044,13 @@

 \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

--- a/tree234.c

+++ b/tree234.c

@@ -1376,7 +1376,7 @@

     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;

--- a/tree234.h

+++ b/tree234.h

@@ -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 @@

  * 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);

 /*