Reindent function

This commit is contained in:
Patrick Pelissier committed 2020-05-24 19:19:19 +02:00
1 parent 7761fb6bf1
commit 9710e014f2
1 file changed
+3 -2
+3 -2
View File
@@ -202,7 +202,7 @@
/* Internal contract of a B+TREE node */ /* Internal contract of a B+TREE node 'node' or root 'root' */
#ifdef NDEBUG #ifdef NDEBUG
# define BPTREEI_NODE_CONTRACT(N, isMulti, key_oplist, node, root) do { } while (0) # define BPTREEI_NODE_CONTRACT(N, isMulti, key_oplist, node, root) do { } while (0)
#else #else
@@ -419,8 +419,9 @@
for(int i = 0; i < num; i++) { \ for(int i = 0; i < num; i++) { \
M_CALL_INIT_SET(value_oplist, n->kind.value[i], o->kind.value[i]); \ M_CALL_INIT_SET(value_oplist, n->kind.value[i], o->kind.value[i]); \
} \ } \
,) \ , /* End of isMap */) \
} else { \ } else { \
/* Not a leaf */ \
for(int i = 0; i <= num; i++) { \ for(int i = 0; i <= num; i++) { \
assert(o->kind.node[i] != root); \ assert(o->kind.node[i] != root); \
n->kind.node[i] = M_C(name, _copy_node)(o->kind.node[i], root); \ n->kind.node[i] = M_C(name, _copy_node)(o->kind.node[i], root); \