admin/mlib
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Remove uneeded test

Browse Source
This commit is contained in:
Patrick Pelissier committed 2022-07-26 22:48:47 +02:00
1 parent 22b18830f7
commit 90c54a48d0
1 file changed
+2 -5
Download Patch File Download Diff File Expand all files Collapse all files
m-tree.h
+2 -5
View File
@@ -511,13 +511,10 @@ typedef int32_t m_tr33_index_t;
it.tree->tab[it.index].left = i; \ it.tree->tab[it.index].left = i; \
/* If there is a left node, update its right */ \ /* If there is a left node, update its right */ \
if (left >= 0) { it.tree->tab[left].right = i; } \ if (left >= 0) { it.tree->tab[left].right = i; } \
/* Might insert left of root: update root in this case */ \ if (it.tree->tab[parent].child == it.index) { \
if (M_UNLIKELY(parent == M_TR33_ROOT_NODE)) { \
it.tree->root_index = i; \
} else { if (it.tree->tab[parent].child == it.index) { \
/* Update the first child of the parent */ \ /* Update the first child of the parent */ \
it.tree->tab[parent].child = i; \ it.tree->tab[parent].child = i; \
} } \ } \
/* Return updated iterator on the inserted node */ \ /* Return updated iterator on the inserted node */ \
it.index = i; \ it.index = i; \
M_CALL_INIT_SET(oplist, it.tree->tab[i].data, data); \ M_CALL_INIT_SET(oplist, it.tree->tab[i].data, data); \