On 3/24/21 1:00 AM, Bhaskar Chowdhury wrote:
>
> s/maintanence/maintenance/
>
> Signed-off-by: Bhaskar Chowdhury
Acked-by: Randy Dunlap
> ---
> Documentation/core-api/rbtree.rst | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> 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::
> --
--
~Randy