For loop is running un-nacessrily after match.

pdf/pdfium/pdfium_engine.cc

Index: pdf/pdfium/pdfium_engine.cc
diff --git a/pdf/pdfium/pdfium_engine.cc b/pdf/pdfium/pdfium_engine.cc
index 42f69e7bf2a9bb30154015f0bd2269ff6f0a908b..3d3ce4fbf994430f5a9a792c5cc34e7cffdb417c 100644
--- a/pdf/pdfium/pdfium_engine.cc
+++ b/pdf/pdfium/pdfium_engine.cc
@@ -2721,10 +2721,12 @@ PDFiumEngine::SelectionChangeInvalidator::~SelectionChangeInvalidator() {
   GetVisibleSelectionsScreenRects(&new_selections);
   for (size_t i = 0; i < new_selections.size(); ++i) {
     for (size_t j = 0; j < old_selections_.size(); ++j) {
-      if (new_selections[i] == old_selections_[j]) {
+      if (!old_selections_[j].IsEmpty() &&
+          new_selections[i] == old_selections_[j]) {
         // Rectangle was selected before and after, so no need to invalidate it.
         // Mark the rectangles by setting them to empty.
         new_selections[i] = old_selections_[j] = pp::Rect();
+        break;

[raymes, 2014/09/29 01:09:51]

I don't think we can early return from this loop (though I could be wrong). To
me it appears that this loop is trying to find which selections haven't changed
so that we don't need to invalidate those regions on the screen. AFAICT this
requires searching through all of them.

[Deepak, 2014/09/29 02:41:28]

@raymes, When below condition 
new_selections[i] == old_selections_[j]
matchs , Then we are setting both new_selection[i] and old+selection[j] as empty
rect, After that if we run inner loop then 
if old_selection is empty rect then only condition will match as new_selection
is already set empty rect.
and what is the point of checking empty rect's match in condition and then
assigning them empty rect again?

As their is no point of checking condition if old_selection is empty.
so this changes will avoid un-neccessary loop running.

[raymes, 2014/09/29 03:08:16]

Oh I see! Is it ever possible for old_selections_ to contain duplicates? I guess
not but I haven't checked.

[Deepak, 2014/09/29 03:19:52]

I think old selection does not contain duplicates.
And even it contains duplicates it will naver match as we have alreay set
new_selection[i] as empty rect :).

Little example:

new_selection: [A,C,D]
old_selection: [A,C,Z,A]

so in the above loop when new_selection[0] matches with old_selection[0]
then it is like
new_selection: [" ",C,D]
old_selection: [" ",C,Z,A]
then even old_selection have duplicate or not , new_seletion[0] will naver match
to any of the item in old_selction.So no need to run the loop.

Now when outerloop runs again then their is no need to match new_selection[1]
with old_selection[0] as old_selection[0] is already empty, then again
new_selection[1] will matchs with old_selection[1] and it will be 
new_selection: [" "," ",D]
old_selection: [" "," ",Z,A]
Then no point of running inner loop as new_selection[1] is empty and it will
only matchs with old_selection that have empty, and even after match their is no
point of setting them empty again as they are already empty.

       }
     }
   }