[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <20210324080046.20709-1-unixbhaskar@gmail.com>
Date: Wed, 24 Mar 2021 13:30:46 +0530
From: Bhaskar Chowdhury <unixbhaskar@...il.com>
To: corbet@....net, walken@...gle.com, unixbhaskar@...il.com,
grandmaster@...klimov.de, willy@...radead.org,
linux-doc@...r.kernel.org, linux-kernel@...r.kernel.org
Cc: rdunlap@...radead.org
Subject: [PATCH] docs: rbtree.rst: Fix a typo
s/maintanence/maintenance/
Signed-off-by: Bhaskar Chowdhury <unixbhaskar@...il.com>
---
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::
--
2.30.1
Powered by blists - more mailing lists