summaryrefslogtreecommitdiff
path: root/src/rax.c
diff options
context:
space:
mode:
authorJack Drogon <jack.xsuperman@gmail.com>2018-07-01 13:24:50 +0800
committerSalvatore Sanfilippo <antirez@gmail.com>2018-07-03 18:19:46 +0200
commit93238575f77630f24e0472bdbf7eecb73a4652a8 (patch)
treefb075adb140513364b5d357c676196d33b709602 /src/rax.c
parent94b3ee61420f8638d9cdba32877864deef91d5e9 (diff)
downloadredis-93238575f77630f24e0472bdbf7eecb73a4652a8.tar.gz
Fix typo
Diffstat (limited to 'src/rax.c')
-rw-r--r--src/rax.c4
1 files changed, 2 insertions, 2 deletions
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);