# HG changeset patch
# User Igor Sysoev <igor@sysoev.ru>
# Date 1228236656 0
# Node ID 3aa4fd0e7dc5b752fe1349b56c593354acc541e8
# Parent  8522a901df2f1c1f9e9365f1e7e795836cf7c523
fix comment

diff -r 8522a901df2f -r 3aa4fd0e7dc5 src/core/ngx_radix_tree.c
--- a/src/core/ngx_radix_tree.c	Tue Dec 02 15:02:36 2008 +0000
+++ b/src/core/ngx_radix_tree.c	Tue Dec 02 16:50:56 2008 +0000
@@ -42,13 +42,13 @@
     }
 
     /*
-     * The preallocation the first nodes: 0, 1, 00, 01, 10, 11, 000, 001, etc.
-     * increases the TLB hits even if for the first lookup iterations.
-     * On the 32-bit platforms the 7 preallocated bits takes continuous 4K,
-     * 8 - 8K, 9 - 16K, etc.  On the 64-bit platforms the 6 preallocated bits
+     * Preallocation of first nodes : 0, 1, 00, 01, 10, 11, 000, 001, etc.
+     * increases TLB hits even if for first lookup iterations.
+     * On 32-bit platforms the 7 preallocated bits takes continuous 4K,
+     * 8 - 8K, 9 - 16K, etc.  On 64-bit platforms the 6 preallocated bits
      * takes continuous 4K, 7 - 8K, 8 - 16K, etc.  There is no sense to
      * to preallocate more than one page, because further preallocation
-     * distributes the only bit per page.  Instead, the random insertion
+     * distributes the only bit per page.  Instead, a random insertion
      * may distribute several bits per page.
      *
      * Thus, by default we preallocate maximum