rbtree.txt: fix typo in cached rbtree section

PATCH In review Vito Caputo 2 participants 2 messages Dec 1, 2017 – Dec 2, 2017 Documentation

Share & tools

Vito Caputo

author

2017-12-01 23:45 UTC #0 lore raw

PATCH 1/1 rbtree.txt: fix typo in cached rbtree section

---
 Documentation/rbtree.txt | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

Documentation/rbtree.txt +3 -3

index c42a21b99046..3a4c23bc90b2 100644
@@ -197,9 +197,9 @@ Cached rbtrees
 --------------
 
 Computing the leftmost (smallest) node is quite a common task for binary
-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
+search trees, such as for traversals or users relying on a 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.

Signature · 1 line

2.11.0

I'm happy to ack your patch but you have to send it correctly. You are missing a changelog (although it ought to be small due to the trivial change) as well as you SoB tag. Please consult Documentation/process/submitting-patches.rst.

You also need to Cc akpm as he routes such areas to Linus.

Thanks,
Davidlohr

Quoted 24 lines · Vito Caputo

---
Documentation/rbtree.txt | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
Documentation/rbtree.txt +0 -1
index c42a21b99046..3a4c23bc90b2 100644
@@ -197,9 +197,9 @@ Cached rbtrees
--------------
 
Computing the leftmost (smallest) node is quite a common task for binary
Documentation/rbtree.txt +3 -3
-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
+search trees, such as for traversals or users relying on a 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.
Signature · 1 line
2.11.0