| OLD | NEW |
|---|
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "net/url_request/url_request_job_manager.h" | 5 #include "net/url_request/url_request_job_manager.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 | 8 |
| 9 #include "base/memory/singleton.h" | 9 #include "base/memory/singleton.h" |
| 10 #include "build/build_config.h" | 10 #include "build/build_config.h" |
| (...skipping 125 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 136 request, network_delegate); | 136 request, network_delegate); |
| 137 if (job) | 137 if (job) |
| 138 return job; | 138 return job; |
| 139 | 139 |
| 140 return NULL; | 140 return NULL; |
| 141 } | 141 } |
| 142 | 142 |
| 143 // static | 143 // static |
| 144 bool URLRequestJobManager::SupportsScheme(const std::string& scheme) { | 144 bool URLRequestJobManager::SupportsScheme(const std::string& scheme) { |
| 145 for (size_t i = 0; i < arraysize(kBuiltinFactories); ++i) { | 145 for (size_t i = 0; i < arraysize(kBuiltinFactories); ++i) { |
| 146 if (LowerCaseEqualsASCII(scheme, kBuiltinFactories[i].scheme)) | 146 if (base::LowerCaseEqualsASCII(scheme, kBuiltinFactories[i].scheme)) |
| 147 return true; | 147 return true; |
| 148 } | 148 } |
| 149 | 149 |
| 150 return false; | 150 return false; |
| 151 } | 151 } |
| 152 | 152 |
| 153 URLRequestJobManager::URLRequestJobManager() { | 153 URLRequestJobManager::URLRequestJobManager() { |
| 154 } | 154 } |
| 155 | 155 |
| 156 URLRequestJobManager::~URLRequestJobManager() {} | 156 URLRequestJobManager::~URLRequestJobManager() {} |
| 157 | 157 |
| 158 } // namespace net | 158 } // namespace net |
| OLD | NEW |
|---|
Chromium Code Reviews
