blob: a56ac6f2b1f4b81d87e875b2ac37802e3956f583 [file] [log] [blame]
// 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 <map>
#include "base/callback.h"
#include "base/macros.h"
#include "base/single_thread_task_runner.h"
#include "base/test/simple_test_tick_clock.h"
namespace media {
class FakeSingleThreadTaskRunner : public base::SingleThreadTaskRunner {
explicit FakeSingleThreadTaskRunner(base::SimpleTestTickClock* clock);
void RunTasks();
// Note: Advances |clock_|.
void Sleep(base::TimeDelta t);
// base::SingleThreadTaskRunner implementation.
bool PostDelayedTask(const base::Location& from_here,
base::OnceClosure task,
base::TimeDelta delay) final;
bool RunsTasksInCurrentSequence() const final;
// This function is currently not used, and will return false.
bool PostNonNestableDelayedTask(const base::Location& from_here,
base::OnceClosure task,
base::TimeDelta delay) final;
~FakeSingleThreadTaskRunner() final;
base::SimpleTestTickClock* const clock_;
// A compound key is used to ensure FIFO execution of delayed tasks scheduled
// for the same point-in-time. The second part of the key is simply a FIFO
// sequence number.
using TaskKey = std::pair<base::TimeTicks, unsigned int>;
// Note: The std::map data structure was chosen because the entire
// cast_unittests suite performed 20% faster than when using
// std::priority_queue.
std::map<TaskKey, base::OnceClosure> tasks_;
bool fail_on_next_task_;
} // namespace media