[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <20250415124928.14372-1-charlie910417@gmail.com>
Date: Tue, 15 Apr 2025 20:49:28 +0800
From: Po-Ying Chiu <charlie910417@...il.com>
To: dsterba@...e.cz
Cc: beckerlee3@...il.com,
charlie910417@...il.com,
dsterba@...e.com,
jserv@...s.ncku.edu.tw,
linux-kernel@...r.kernel.org,
mhiramat@...nel.org,
peterz@...radead.org,
wqu@...e.com
Subject: [PATCH v2] rbtree: Fix typo in header comment
Correct "drammatically" to "dramatically" in the rbtree.h header comment.
This improves the readability of the header comment.
Signed-off-by: Po-Ying Chiu <charlie910417@...il.com>
---
Changes since v1:
* Rephrased the whole paragraph to imporve readability.
include/linux/rbtree.h | 8 ++++----
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/include/linux/rbtree.h b/include/linux/rbtree.h
index 8d2ba3749866..02b6733cce55 100644
--- a/include/linux/rbtree.h
+++ b/include/linux/rbtree.h
@@ -6,10 +6,10 @@
linux/include/linux/rbtree.h
- To use rbtrees you'll have to implement your own insert and search cores.
- This will avoid us to use callbacks and to drop drammatically performances.
- I know it's not the cleaner way, but in C (not in C++) to get
- performances and genericity...
+ To use rbtrees, you'll have to implement your own insert and search cores.
+ This avoids the need for callbacks, which would otherwise significantly reduce performance.
+ It may not be the cleanest approach, but in C (as opposed to C++), it is often
+ necessary to achieve both performance and genericity.
See Documentation/core-api/rbtree.rst for documentation and samples.
*/
--
2.43.0
Powered by blists - more mailing lists