diff options
| author | Alexander Moisseev <moiseev@mezonplus.ru> | 2017-06-27 10:44:19 +0300 |
|---|---|---|
| committer | Alexander Moisseev <moiseev@mezonplus.ru> | 2017-06-27 10:44:19 +0300 |
| commit | bb5a9f8e451bc206e78c9d4d03eb4cbdbef260b3 (patch) | |
| tree | ec38b50c99765caed67aaf23db308b17cc407d5f /contrib/lc-btrie | |
| parent | 146886df6d250a376b92d1bb615cb93679a7d6e8 (diff) | |
| download | rspamd-bb5a9f8e451bc206e78c9d4d03eb4cbdbef260b3.tar.gz rspamd-bb5a9f8e451bc206e78c9d4d03eb4cbdbef260b3.zip | |
[Minor] Massive spelling correction
by a bot https://github.com/ka7/misspell_fixer
Diffstat (limited to 'contrib/lc-btrie')
| -rw-r--r-- | contrib/lc-btrie/btrie.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/contrib/lc-btrie/btrie.c b/contrib/lc-btrie/btrie.c index 51357a1d6..fe768fc56 100644 --- a/contrib/lc-btrie/btrie.c +++ b/contrib/lc-btrie/btrie.c @@ -168,7 +168,7 @@ * array of children for that path can be found by counting the number * of set bits to the left of that bit. * - * Similary, the internal bitmap has one bit for each binary node + * Similarly, the internal bitmap has one bit for each binary node * which is internal to the multibit node. To determine whether there * is data stored for an internal prefix, one checks the corresponding * bit in the internal bitmap. As for extending paths, the index into @@ -946,7 +946,7 @@ static void coalesce_lc_node(struct btrie *btrie, struct lc_node *node, btrie->n_lc_nodes--; } else { - /* can't merge, but can take some of childs bits */ + /* can't merge, but can take some of children bits */ unsigned cshift = lc_shift (end + spare_bits) - lc_shift (end); memcpy(node->prefix + shift, child->prefix, |