From 8c598bcffbdc3cccee5f5a6c3ee1a8a023df73b4 Mon Sep 17 00:00:00 2001 From: "jruderman%hmc.edu" Date: Sat, 10 Nov 2007 00:32:41 +0000 Subject: [PATCH] Fix typo in comment. git-svn-id: svn://10.0.0.236/trunk@239113 18797224-902f-48f8-a5cc-f745e15eee43 --- mozilla/content/base/src/nsContentIterator.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/mozilla/content/base/src/nsContentIterator.cpp b/mozilla/content/base/src/nsContentIterator.cpp index e0b3e8ae44e..52af07e8287 100644 --- a/mozilla/content/base/src/nsContentIterator.cpp +++ b/mozilla/content/base/src/nsContentIterator.cpp @@ -253,11 +253,11 @@ protected: // instead of the mre robust array of indicies (which is what the basic content iterator uses)? // The reason is that subtree iterators do not do much transitioning between parents and children. // They tend to stay at the same level. In fact, you can prove (though I won't attempt it here) - // that they change levels at most n+m times, where n is the height of the parent heirarchy from the - // range start to the common ancestor, and m is the the height of the parent heirarchy from the + // that they change levels at most n+m times, where n is the height of the parent hierarchy from the + // range start to the common ancestor, and m is the the height of the parent hierarchy from the // range end to the common ancestor. If we used the index array, we would pay the price up front // for n, and then pay the cost for m on the fly later on. With the simple cache, we only "pay - // as we go". Either way, we call IndexOf() once for each change of level in the heirarchy. + // as we go". Either way, we call IndexOf() once for each change of level in the hierarchy. // Since a trivial index is much simpler, we use it for the subtree iterator. PRBool mIsDone;