diff options
Diffstat (limited to 'src/include/lib/radixtree.h')
| -rw-r--r-- | src/include/lib/radixtree.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/include/lib/radixtree.h b/src/include/lib/radixtree.h index dc4c00d38a6..d9f545d491a 100644 --- a/src/include/lib/radixtree.h +++ b/src/include/lib/radixtree.h @@ -64,7 +64,7 @@ * small enough. * * There are two other techniques described in the paper that are not - * impemented here: + * implemented here: * - path compression "...removes all inner nodes that have only a single child." * - lazy path expansion "...inner nodes are only created if they are required * to distinguish at least two leaf nodes." @@ -385,7 +385,7 @@ typedef struct RT_NODE /* * Number of children. uint8 is sufficient for all node kinds, because - * nodes shrink when this number gets lower than some thresold. Since + * nodes shrink when this number gets lower than some threshold. Since * node256 cannot possibly have zero children, we let the counter overflow * and we interpret zero as "256" for this node kind. */ @@ -1581,7 +1581,7 @@ RT_EXTEND_UP(RT_RADIX_TREE * tree, uint64 key) Assert(shift < target_shift); - /* Grow tree upwards until start shift can accomodate the key */ + /* Grow tree upwards until start shift can accommodate the key */ while (shift < target_shift) { RT_CHILD_PTR node; |