summaryrefslogtreecommitdiff
path: root/src/btree_naive.c
diff options
context:
space:
mode:
author0scar <qgt268@alumni.ku.dk>2022-01-04 20:14:39 +0000
committer0scar <qgt268@alumni.ku.dk>2022-01-04 20:14:39 +0000
commit8ffbfdc0beb127b367c0aa3acd35ea66a41c7dd9 (patch)
treee836fa0aca50de474e5d2ce224f1049f54f916aa /src/btree_naive.c
parent552754844274b851c1a8d1ac33a450934df327af (diff)
Remove unused parameter
Diffstat (limited to 'src/btree_naive.c')
-rw-r--r--src/btree_naive.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/btree_naive.c b/src/btree_naive.c
index 021453e..2ffd3ec 100644
--- a/src/btree_naive.c
+++ b/src/btree_naive.c
@@ -77,7 +77,7 @@ struct node* node_new(const ssize_t degree, const size_t elem_size) {
* allocated.
* returnvalue: `false` if we we're unable to allocate space for the new
* children. */
-bool node_transition(struct node *node, const ssize_t degree, const size_t elem_size) {
+bool node_transition(struct node *node, const ssize_t degree) {
const int max_children = 2 * degree + 1;
int c;
@@ -142,7 +142,7 @@ void node_tree_split_child(
/* `z` should be a branching node if `y` is */
if (!node_leaf(y)) {
- node_transition(z, t, elem_size);
+ node_transition(z, t);
}
z->n = t - 1;
@@ -377,7 +377,7 @@ struct node* node_insert(
if (node_full(degree, root)) {
s = node_new(degree, elem_size);
- node_transition(s, degree, elem_size);
+ node_transition(s, degree);
s->children[s->c++] = root;
/* TODO Check if the root has changed */
node_tree_split_child(degree, elem_size, s, 0);