From 93238575f77630f24e0472bdbf7eecb73a4652a8 Mon Sep 17 00:00:00 2001 From: Jack Drogon Date: Sun, 1 Jul 2018 13:24:50 +0800 Subject: Fix typo --- src/rax.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/rax.c') diff --git a/src/rax.c b/src/rax.c index c2aa95c3d..92b367550 100644 --- a/src/rax.c +++ b/src/rax.c @@ -467,7 +467,7 @@ int raxGenericInsert(rax *rax, unsigned char *s, size_t len, void *data, void ** /* If the node we stopped at is a compressed node, we need to * split it before to continue. * - * Splitting a compressed node have a few possibile cases. + * Splitting a compressed node have a few possible cases. * Imagine that the node 'h' we are currently at is a compressed * node contaning the string "ANNIBALE" (it means that it represents * nodes A -> N -> N -> I -> B -> A -> L -> E with the only child @@ -749,7 +749,7 @@ int raxGenericInsert(rax *rax, unsigned char *s, size_t len, void *data, void ** cp = raxNodeLastChildPtr(trimmed); memcpy(cp,&postfix,sizeof(postfix)); - /* Finish! We don't need to contine with the insertion + /* Finish! We don't need to continue with the insertion * algorithm for ALGO 2. The key is already inserted. */ rax->numele++; rax_free(h); -- cgit v1.2.1