OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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 "content/browser/service_worker/embedded_worker_instance.h" | 5 #include "content/browser/service_worker/embedded_worker_instance.h" |
6 | 6 |
| 7 #include <algorithm> |
| 8 #include <utility> |
| 9 |
7 #include "base/bind_helpers.h" | 10 #include "base/bind_helpers.h" |
8 #include "content/browser/devtools/embedded_worker_devtools_manager.h" | 11 #include "content/browser/devtools/embedded_worker_devtools_manager.h" |
9 #include "content/browser/service_worker/embedded_worker_registry.h" | 12 #include "content/browser/service_worker/embedded_worker_registry.h" |
10 #include "content/browser/service_worker/service_worker_context_core.h" | 13 #include "content/browser/service_worker/service_worker_context_core.h" |
11 #include "content/common/service_worker/embedded_worker_messages.h" | 14 #include "content/common/service_worker/embedded_worker_messages.h" |
12 #include "content/public/browser/browser_thread.h" | 15 #include "content/public/browser/browser_thread.h" |
13 #include "content/public/browser/render_process_host.h" | 16 #include "content/public/browser/render_process_host.h" |
14 #include "ipc/ipc_message.h" | 17 #include "ipc/ipc_message.h" |
15 #include "url/gurl.h" | 18 #include "url/gurl.h" |
16 | 19 |
(...skipping 319 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
336 // Sort descending by the reference count. | 339 // Sort descending by the reference count. |
337 std::sort(counted.begin(), counted.end(), SecondGreater()); | 340 std::sort(counted.begin(), counted.end(), SecondGreater()); |
338 | 341 |
339 std::vector<int> result(counted.size()); | 342 std::vector<int> result(counted.size()); |
340 for (size_t i = 0; i < counted.size(); ++i) | 343 for (size_t i = 0; i < counted.size(); ++i) |
341 result[i] = counted[i].first; | 344 result[i] = counted[i].first; |
342 return result; | 345 return result; |
343 } | 346 } |
344 | 347 |
345 } // namespace content | 348 } // namespace content |
OLD | NEW |