Avoid conversion of index to BookmarkNode pointer unnacessarily.

chrome/browser/sync/glue/bookmark_model_associator.cc

 // Copyright 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "chrome/browser/sync/glue/bookmark_model_associator.h"
 
 #include <stack>
 
 #include "base/bind.h"
 #include "base/command_line.h"
@@ skipping 687 matching lines @@
             BookmarkNodeFinder::NodeMatches(
                 child, GURL(delete_entry.specifics.bookmark().url()),
                 delete_entry.specifics.bookmark().title(),
                 delete_entry.is_folder)) {
           if (child->is_folder()) {
             // Remember matched folder without removing and delete only empty
             // ones later.
             folders_matched.push_back(
                 FolderInfo(child, parent, delete_entry.id));
           } else {
-            bookmark_model_->Remove(parent, child_index);
+            bookmark_model_->Remove(child);
             ++num_bookmark_deleted;
           }
           // Move unmatched journal here and decrement counter.
           bk_delete_journals[journal_index] =
               bk_delete_journals[--num_journals_unmatched];
           break;
         }
       }
     }
   }
 
   // Ids of sync nodes not found in bookmark model, meaning the deletions are
   // persisted and correponding delete journals can be dropped.
   std::set<int64> journals_to_purge;
 
   // Remove empty folders from bottom to top.
   for (FolderInfoList::reverse_iterator it = folders_matched.rbegin();
       it != folders_matched.rend(); ++it) {
     if (it->folder->child_count() == 0) {
-      bookmark_model_->Remove(it->parent, it->parent->GetIndexOf(it->folder));
+      bookmark_model_->Remove(it->folder);
       ++num_bookmark_deleted;
     } else {
       // Keep non-empty folder and remove its journal so that it won't match
       // again in the future.
       journals_to_purge.insert(it->sync_id);
     }
   }
 
   // Purge unmatched journals.
   for (size_t i = 0; i < num_journals_unmatched; ++i)
@@ skipping 99 matching lines @@
                                  syncer::SyncError::PERSISTENCE_ERROR,
                                  message,
                                  syncer::BOOKMARKS);
       }
     }
   }
   return syncer::SyncError();
 }
 
 }  // namespace browser_sync