diff options
| author | 0scar <qgt268@alumni.ku.dk> | 2022-08-30 13:19:36 +0000 |
|---|---|---|
| committer | 0scar <qgt268@alumni.ku.dk> | 2022-08-30 13:19:36 +0000 |
| commit | 577b4bd33c81abed97878779e5fc7a7f32754a01 (patch) | |
| tree | 89d63be93a1300ade28a5f1b3d0d661f47fdfc07 /src/btree_naive.c | |
| parent | b862c35a0e9251912215518426776f7392f344fb (diff) | |
Fix whitespace in definition
Diffstat (limited to 'src/btree_naive.c')
| -rw-r--r-- | src/btree_naive.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/btree_naive.c b/src/btree_naive.c index 6536318..4a59324 100644 --- a/src/btree_naive.c +++ b/src/btree_naive.c @@ -765,13 +765,13 @@ void* btree_iter(struct btree *tree, struct btree_iter_t *iter) { n = iter->stack[head].node->n; #define BTREE_ITER_POP(it) { \ - iter->stack[head].pos = 0; \ - iter->stack[head].node = NULL; \ - iter->head--; head--; \ - iter->stack[head].pos++; \ - \ - pos = iter->stack[head].pos; \ - n = iter->stack[head].node->n; \ + iter->stack[head].pos = 0; \ + iter->stack[head].node = NULL; \ + iter->head--; head--; \ + iter->stack[head].pos++; \ + \ + pos = iter->stack[head].pos; \ + n = iter->stack[head].node->n; \ } /* Check if we have reached the end of a node. |