summaryrefslogtreecommitdiff
path: root/src/btree_naive.c
diff options
context:
space:
mode:
author0scar <qgt268@alumni.ku.dk>2022-08-30 16:47:01 +0000
committer0scar <qgt268@alumni.ku.dk>2022-08-30 16:47:01 +0000
commite629f4e0ad1b169e7078aa611f210d142111ba87 (patch)
treedc377a8f59b0169083baad7b9b0bda6fe74d8956 /src/btree_naive.c
parentb75e62146782ba19005f824689b73792083d3d24 (diff)
Fix unused return value
Diffstat (limited to 'src/btree_naive.c')
-rw-r--r--src/btree_naive.c7
1 files changed, 4 insertions, 3 deletions
diff --git a/src/btree_naive.c b/src/btree_naive.c
index c89674d..0545c8a 100644
--- a/src/btree_naive.c
+++ b/src/btree_naive.c
@@ -321,14 +321,16 @@ void node_shift_right(
}
/* return: Returns the new root, if a split happens */
-struct node* node_insert_nonfull(
+void node_insert_nonfull(
struct node *root,
void *elem,
const ssize_t degree,
const size_t elem_size,
int (*cmp)(const void *a, const void *b)) {
+
/* TODO check correctness */
ssize_t i = root->n - 1;
+
if (node_leaf(root)) {
size_t offset = elem_size * i;
while (i >= 0 && cmp(elem, root->items + offset) < 0) {
@@ -360,9 +362,8 @@ struct node* node_insert_nonfull(
nextchild = root->children[++i];
}
}
- return node_insert_nonfull(nextchild, elem, degree, elem_size, cmp);
+ node_insert_nonfull(nextchild, elem, degree, elem_size, cmp);
}
- return NULL; /* TODO: Fix return value */
}
/* Returns the new root, if a split occurs */