From c535766c22d3c9ba6686ee61c4800c4f13791d2d Mon Sep 17 00:00:00 2001 From: Patrick Pelissier Date: Mon, 17 Jun 2019 07:26:11 +0200 Subject: [PATCH] Update/Clean up basic type --- m-rbtree.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/m-rbtree.h b/m-rbtree.h index 0deb22ec..432bc8f8 100644 --- a/m-rbtree.h +++ b/m-rbtree.h @@ -161,7 +161,7 @@ typedef enum { \ typedef struct M_C(name, _it_s) { \ node_t *stack[RBTREEI_MAX_STACK]; \ - char which[RBTREEI_MAX_STACK]; \ + int8_t which[RBTREEI_MAX_STACK]; \ unsigned int cpt; \ } it_t[1]; \ \ @@ -245,7 +245,7 @@ typedef enum { { \ RBTREEI_CONTRACT(tree); \ node_t *tab[RBTREEI_MAX_STACK]; \ - char which[RBTREEI_MAX_STACK]; \ + int8_t which[RBTREEI_MAX_STACK]; \ unsigned int cpt = 0; \ node_t *n = tree->node; \ /* If nothing, create new node */ \ @@ -356,7 +356,7 @@ typedef enum { tree->node = p; \ } else { \ assert (cpt >= 3); \ - tab[cpt-3]->child[(int) which[cpt-3]] = p; \ + tab[cpt-3]->child[which[cpt-3]] = p; \ } \ /* Done */ \ RBTREEI_CONTRACT (tree); \ @@ -706,7 +706,7 @@ typedef enum { { \ RBTREEI_CONTRACT (tree); \ node_t *tab[RBTREEI_MAX_STACK]; \ - unsigned char which[RBTREEI_MAX_STACK]; \ + int8_t which[RBTREEI_MAX_STACK]; \ unsigned int cpt = 0; \ node_t *n = tree->node; \ which[0] = 0; \