---

yaml --- r: 187779 b: refs/heads/master c: 3e58974 h: refs/heads/master i: 187777: df49014 187775: ef71e1e v: v3
git-mirror · Feb 25, 2010 · 53a72ef · 53a72ef
1 parent a538ffe
commit 53a72ef
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 5 deletions.
diff --git a/[refs] b/[refs]
@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 7c821a179f91c3ad52588400ce52a7fb48b9868c
+refs/heads/master: 3e58974027b04e84f68b964ef368a6cd758e2f84
diff --git a/trunk/include/linux/rbtree.h b/trunk/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,