[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <20250412015516.8924-1-charlie910417@gmail.com>
Date: Sat, 12 Apr 2025 09:55:16 +0800
From: Po-Ying Chiu <charlie910417@...il.com>
To: peterz@...radead.org
Cc: dsterba@...e.com,
wqu@...e.com,
mhiramat@...nel.org,
beckerlee3@...il.com,
linux-kernel@...r.kernel.org,
jserv@...s.ncku.edu.tw,
Po-Ying Chiu <charlie910417@...il.com>
Subject: [PATCH] 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>
---
include/linux/rbtree.h | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/include/linux/rbtree.h b/include/linux/rbtree.h
index 8d2ba3749866..78a7a260c36f 100644
--- a/include/linux/rbtree.h
+++ b/include/linux/rbtree.h
@@ -7,7 +7,7 @@
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.
+ This will avoid us to use callbacks and to drop dramatically performances.
I know it's not the cleaner way, but in C (not in C++) to get
performances and genericity...
base-commit: 2eb959eeecc64fa56e9f89a5fc496da297585cbe
--
2.43.0
Powered by blists - more mailing lists