| Index: base/task_scheduler/sequence_sort_key.h
|
| diff --git a/base/task_scheduler/sequence_sort_key.h b/base/task_scheduler/sequence_sort_key.h
|
| new file mode 100644
|
| index 0000000000000000000000000000000000000000..d03b9ac72ff36fdbadafa6551664a4ccc9958401
|
| --- /dev/null
|
| +++ b/base/task_scheduler/sequence_sort_key.h
|
| @@ -0,0 +1,43 @@
|
| +// Copyright 2016 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 BASE_TASK_SCHEDULER_SEQUENCE_SORT_KEY_H_
|
| +#define BASE_TASK_SCHEDULER_SEQUENCE_SORT_KEY_H_
|
| +
|
| +#include "base/base_export.h"
|
| +#include "base/gtest_prod_util.h"
|
| +#include "base/task_scheduler/task_traits.h"
|
| +#include "base/time/time.h"
|
| +
|
| +namespace base {
|
| +namespace internal {
|
| +
|
| +// A SequenceSortKey determines the position of a Sequence in a PriorityQueue.
|
| +// Contrary to a Sequence, which can be modified when it is inside a
|
| +// PriorityQueue, a SequenceSortKey is immutable.
|
| +class BASE_EXPORT SequenceSortKey {
|
| + public:
|
| + SequenceSortKey(TaskPriority priority, TimeTicks next_task_sequenced_time);
|
| +
|
| + bool operator<(const SequenceSortKey& other) const;
|
| + bool operator==(const SequenceSortKey& other) const;
|
| +
|
| + TaskPriority priority() const { return priority_; }
|
| +
|
| + private:
|
| + FRIEND_TEST_ALL_PREFIXES(TaskSchedulerSequenceTest, GetSortKey);
|
| +
|
| + // Highest task priority in the sequence at the time this sort key was
|
| + // created.
|
| + TaskPriority priority_;
|
| +
|
| + // Sequenced time of the next task to run in the sequence at the time this
|
| + // sort key was created.
|
| + TimeTicks next_task_sequenced_time_;
|
| +};
|
| +
|
| +} // namespace internal
|
| +} // namespace base
|
| +
|
| +#endif // BASE_TASK_SCHEDULER_SEQUENCE_SORT_KEY_H_
|
|
|