Use std::tie for multi-member comparisons

chrome/browser/browsing_data/browsing_data_indexed_db_helper.cc

 // Copyright (c) 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/browsing_data/browsing_data_indexed_db_helper.h"
 
+#include <tuple>
 #include <vector>
 
 #include "base/bind.h"
 #include "base/location.h"
 #include "base/time/time.h"
 #include "chrome/browser/browsing_data/browsing_data_helper.h"
 #include "content/public/browser/browser_thread.h"
 #include "content/public/browser/indexed_db_context.h"
 
 using content::BrowserThread;
@@ skipping 56 matching lines @@
     : origin(origin),
       name(name) {
 }
 
 CannedBrowsingDataIndexedDBHelper::
 PendingIndexedDBInfo::~PendingIndexedDBInfo() {
 }
 
 bool CannedBrowsingDataIndexedDBHelper::PendingIndexedDBInfo::operator<(
     const PendingIndexedDBInfo& other) const {
-  if (origin == other.origin)
-    return name < other.name;
-  return origin < other.origin;
+  return std::tie(origin, name) < std::tie(other.origin, other.name);
 }
 
 CannedBrowsingDataIndexedDBHelper::CannedBrowsingDataIndexedDBHelper(
     content::IndexedDBContext* context)
     : BrowsingDataIndexedDBHelper(context) {
 }
 
 CannedBrowsingDataIndexedDBHelper::~CannedBrowsingDataIndexedDBHelper() {}
 
 void CannedBrowsingDataIndexedDBHelper::AddIndexedDB(
@@ skipping 41 matching lines @@
   for (std::set<PendingIndexedDBInfo>::iterator it =
            pending_indexed_db_info_.begin();
        it != pending_indexed_db_info_.end(); ) {
     if (it->origin == origin)
       pending_indexed_db_info_.erase(it++);
     else
       ++it;
   }
   BrowsingDataIndexedDBHelper::DeleteIndexedDB(origin);
 }