blob: 780b49467fb375a17aeacd4af596f79ed59f6670 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
// Copyright 2017 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.
#ifndef COMPONENTS_DOWNLOAD_INTERNAL_ENTRY_UTILS_H_
#define COMPONENTS_DOWNLOAD_INTERNAL_ENTRY_UTILS_H_
#include <map>
#include <set>
#include <string>
#include <vector>
#include "components/download/internal/model.h"
#include "components/download/internal/scheduler/device_status.h"
#include "components/download/public/clients.h"
namespace download {
struct Entry;
namespace util {
// Helper method to return the number of Entry objects in |entries| are
// associated with |client|.
uint32_t GetNumberOfEntriesForClient(DownloadClient client,
const std::vector<Entry*>& entries);
// Effectively runs a map reduce to turn a list of Entry objects into a map of
// [Client Id] -> List of entries. Any Entry in |entries| that does not have a
// matching DownloadClient in |clients| will be put in the
// DownloadClient::INVALID bucket. Any Entry in |entries| with an Entry::State
// that is in |ignored_states| will not be included.
std::map<DownloadClient, std::vector<std::string>> MapEntriesToClients(
const std::set<DownloadClient>& clients,
const std::vector<Entry*>& entries,
const std::set<Entry::State>& ignored_states);
// Gets the least strict scheduling criteria from |entries|, the criteria is
// used to schedule platform background tasks.
Criteria GetSchedulingCriteria(const Model::EntryList& entries);
// Returns if |lhs| entry is a better candidate to be the next download than
// |rhs| based on their priority and cancel time.
bool EntryBetterThan(const Entry& lhs, const Entry& rhs);
} // namespace util
} // namespace download
#endif // COMPONENTS_DOWNLOAD_INTERNAL_ENTRY_UTILS_H_
|
