diff options
| author | Andrea Gelmini <[email protected]> | 2020-06-10 06:24:09 +0200 |
|---|---|---|
| committer | GitHub <[email protected]> | 2020-06-09 21:24:09 -0700 |
| commit | dd4bc569b9f73e8c2445bed90d82c92d98aada03 (patch) | |
| tree | 64bacc1d16199ed350783f0b9a6490fe79ed6a70 /include/sys/btree.h | |
| parent | 7bcb7f0840d1857370dd1f9ee0ad48f9b7939dfd (diff) | |
Fix typos
Correct various typos in the comments and tests.
Reviewed-by: Ryan Moeller <[email protected]>
Reviewed-by: Matthew Ahrens <[email protected]>
Reviewed-by: Brian Behlendorf <[email protected]>
Signed-off-by: Andrea Gelmini <[email protected]>
Closes #10423
Diffstat (limited to 'include/sys/btree.h')
| -rw-r--r-- | include/sys/btree.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/include/sys/btree.h b/include/sys/btree.h index 9fe2534df..3b53476c7 100644 --- a/include/sys/btree.h +++ b/include/sys/btree.h @@ -47,7 +47,7 @@ extern "C" { * at its children. Leaf nodes only contain data elements, and form the bottom * layer of the tree. Unlike B+ Trees, in this B-Tree implementation the * elements in the core nodes are not copies of or references to leaf node - * elements. Each element occcurs only once in the tree, no matter what kind + * elements. Each element occurs only once in the tree, no matter what kind * of node it is in. * * The tree's height is the same throughout, unlike many other forms of search |