diff options
| author | Nikanth Karthikesan <knikanth@suse.de> | 2010-02-25 14:44:56 +0530 |
|---|---|---|
| committer | Jiri Kosina <jkosina@suse.cz> | 2010-02-25 11:45:20 +0100 |
| commit | 3e58974027b04e84f68b964ef368a6cd758e2f84 (patch) | |
| tree | e4879d12ec8940e9448657c71d308a44d55873ad | |
| parent | 7c821a179f91c3ad52588400ce52a7fb48b9868c (diff) | |
doc: fix typo in comment explaining rb_tree usage
Fix typo in comment explaining rb_tree usage.
s/int/in
Signed-off-by: Nikanth Karthikesan <knikanth@suse.de>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
| -rw-r--r-- | include/linux/rbtree.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/include/linux/rbtree.h b/include/linux/rbtree.h index 9c295411d01f..5210a5c60877 100644 --- a/include/linux/rbtree.h +++ b/include/linux/rbtree.h @@ -25,10 +25,10 @@ Some example of insert and search follows here. The search is a plain normal search over an ordered tree. The insert instead must be implemented - int two steps: as first thing the code must insert the element in - order as a red leaf in the tree, then the support library function - rb_insert_color() must be called. Such function will do the - not trivial work to rebalance the rbtree if necessary. + in two steps: First, the code must insert the element in order as a red leaf + in the tree, and then the support library function rb_insert_color() must + be called. Such function will do the not trivial work to rebalance the + rbtree, if necessary. ----------------------------------------------------------------------- static inline struct page * rb_search_page_cache(struct inode * inode, |