diff options
| author | Bhaskar Chowdhury <unixbhaskar@gmail.com> | 2021-03-24 13:30:46 +0530 |
|---|---|---|
| committer | Jonathan Corbet <corbet@lwn.net> | 2021-03-25 11:38:51 -0600 |
| commit | 399bfc8b2918b94a9a1d7b3b1fc9b706b1b81190 (patch) | |
| tree | db7873293da764b8d004f1c3b33ae09ec4d98b39 /Documentation | |
| parent | a8f2a68e42d19e6fc1e0eb6eaef548ef07b19d75 (diff) | |
docs: rbtree.rst: Fix a typo
s/maintanence/maintenance/
Signed-off-by: Bhaskar Chowdhury <unixbhaskar@gmail.com>
Acked-by: Randy Dunlap <rdunlap@infradead.org>
Link: https://lore.kernel.org/r/20210324080046.20709-1-unixbhaskar@gmail.com
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
Diffstat (limited to 'Documentation')
| -rw-r--r-- | Documentation/core-api/rbtree.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Documentation/core-api/rbtree.rst b/Documentation/core-api/rbtree.rst index 6b88837fbf82..ed1a9fbc779e 100644 --- a/Documentation/core-api/rbtree.rst +++ b/Documentation/core-api/rbtree.rst @@ -201,7 +201,7 @@ search trees, such as for traversals or users relying on a the particular order for their own logic. To this end, users can use 'struct rb_root_cached' to optimize O(logN) rb_first() calls to a simple pointer fetch avoiding potentially expensive tree iterations. This is done at negligible runtime -overhead for maintanence; albeit larger memory footprint. +overhead for maintenance; albeit larger memory footprint. Similar to the rb_root structure, cached rbtrees are initialized to be empty via:: |