Standardize usage of virtual/override/final in extensions/

extensions/browser/content_hash_fetcher.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 "extensions/browser/content_hash_fetcher.h"
 
 #include <algorithm>
 
 #include "base/base64.h"
 #include "base/files/file_enumerator.h"
@@ skipping 64 matching lines @@
 
   const std::string& extension_id() { return extension_id_; }
 
   // Returns the set of paths that had a hash mismatch.
   const std::set<base::FilePath>& hash_mismatch_paths() {
     return hash_mismatch_paths_;
   }
 
  private:
   friend class base::RefCountedThreadSafe<ContentHashFetcherJob>;
-  virtual ~ContentHashFetcherJob();
+  ~ContentHashFetcherJob() override;
 
   // Tries to load a verified_contents.json file at |path|. On successfully
   // reading and validing the file, the verified_contents_ member variable will
   // be set and this function will return true. If the file does not exist, or
   // exists but is invalid, it will return false. Also, any invalid
   // file will be removed from disk and
   bool LoadVerifiedContents(const base::FilePath& path);
 
   // Callback for when we're done doing file I/O to see if we already have
   // a verified contents file. If we don't, this will kick off a network
   // request to get one.
   void DoneCheckingForVerifiedContents(bool found);
 
   // URLFetcherDelegate interface
-  virtual void OnURLFetchComplete(const net::URLFetcher* source) override;
+  void OnURLFetchComplete(const net::URLFetcher* source) override;
 
   // Callback for when we're done ensuring we have verified contents, and are
   // ready to move on to MaybeCreateHashes.
   void DoneFetchingVerifiedContents(bool success);
 
   // Callback for the job to write the verified contents to the filesystem.
   void OnVerifiedContentsWritten(size_t expected_size, int write_result);
 
   // The verified contents file from the webstore only contains the treehash
   // root hash, but for performance we want to cache the individual block level
@@ skipping 385 matching lines @@
 
   for (JobMap::iterator i = jobs_.begin(); i != jobs_.end(); ++i) {
     if (i->second.get() == job) {
       jobs_.erase(i);
       break;
     }
   }
 }
 
 }  // namespace extensions