Reduce the memory usage of bookmarks storage

components/bookmarks/browser/titled_url_index.cc

 // Copyright 2014 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 "components/bookmarks/browser/titled_url_index.h"
 
 #include <stdint.h>
 
 #include "base/i18n/case_conversion.h"
 #include "base/i18n/unicodestring.h"
@@ skipping 189 matching lines @@
     // Loop through index adding all entries that start with term to
     // |prefix_matches|.
     TitledUrlNodeSet tmp_prefix_matches;
     // If this is the first term, then store the result directly in |matches|
     // to avoid calling stl intersection (which requires a copy).
     TitledUrlNodeSet* prefix_matches =
         first_term ? matches : &tmp_prefix_matches;
     while (i != index_.end() &&
            i->first.size() >= term.size() &&
            term.compare(0, term.size(), i->first, 0, term.size()) == 0) {
-#if !defined(OS_ANDROID)
-      prefix_matches->insert(i->second.begin(), i->second.end());
-#else
-      // Work around a bug in the implementation of std::set::insert in the STL
-      // used on android (http://crbug.com/367050).
       for (TitledUrlNodeSet::const_iterator n = i->second.begin();
-           n != i->second.end();
-           ++n)
+           n != i->second.end(); ++n) {
         prefix_matches->insert(prefix_matches->end(), *n);
-#endif
+      }
       ++i;
     }
     if (!first_term) {
       *matches =
           base::STLSetIntersection<TitledUrlNodeSet>(*prefix_matches, *matches);
     }
   }
   return !matches->empty();
 }
 
@@ skipping 21 matching lines @@
     // We can get here if the node has the same term more than once. For
     // example, a node with the title 'foo foo' would end up here.
     return;
   }
   i->second.erase(node);
   if (i->second.empty())
     index_.erase(i);
 }
 
 }  // namespace bookmarks