TaskQueue.h 996 B

123456789101112131415161718192021222324252627282930313233343536373839404142434445
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/Queue.h>
  8. #include <LibWeb/HTML/EventLoop/Task.h>
  9. namespace Web::HTML {
  10. class TaskQueue {
  11. public:
  12. explicit TaskQueue(HTML::EventLoop&);
  13. ~TaskQueue();
  14. bool is_empty() const { return m_tasks.is_empty(); }
  15. bool has_runnable_tasks() const;
  16. void add(NonnullOwnPtr<HTML::Task>);
  17. OwnPtr<HTML::Task> take_first_runnable();
  18. void enqueue(NonnullOwnPtr<HTML::Task> task) { add(move(task)); }
  19. OwnPtr<HTML::Task> dequeue()
  20. {
  21. if (m_tasks.is_empty())
  22. return {};
  23. return m_tasks.take_first();
  24. }
  25. void remove_tasks_matching(Function<bool(HTML::Task const&)>);
  26. ErrorOr<Vector<NonnullOwnPtr<Task>>> take_tasks_matching(Function<bool(HTML::Task const&)>);
  27. Task const* last_added_task() const;
  28. private:
  29. HTML::EventLoop& m_event_loop;
  30. Vector<NonnullOwnPtr<HTML::Task>> m_tasks;
  31. };
  32. }