store.rs 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051
  1. use crate::{Task, TaskId, TaskState};
  2. use std::collections::HashMap;
  3. use std::mem;
  4. use std::sync::atomic::AtomicU32;
  5. use std::sync::atomic::Ordering::SeqCst;
  6. pub(crate) struct TaskStore {
  7. tasks: HashMap<TaskId, Task>,
  8. task_id_counter: AtomicU32,
  9. }
  10. impl TaskStore {
  11. pub fn new() -> Self {
  12. Self {
  13. tasks: HashMap::new(),
  14. task_id_counter: AtomicU32::new(0),
  15. }
  16. }
  17. pub(crate) fn insert_task(&mut self, task: Task) {
  18. self.tasks.insert(task.id, task);
  19. }
  20. pub(crate) fn remove_task(&mut self, task_id: &TaskId) -> Option<Task> {
  21. self.tasks.remove(task_id)
  22. }
  23. pub(crate) fn mut_task(&mut self, task_id: &TaskId) -> Option<&mut Task> {
  24. self.tasks.get_mut(task_id)
  25. }
  26. pub(crate) fn read_task(&self, task_id: &TaskId) -> Option<&Task> {
  27. self.tasks.get(task_id)
  28. }
  29. pub(crate) fn clear(&mut self) {
  30. let tasks = mem::take(&mut self.tasks);
  31. tasks.into_values().for_each(|mut task| {
  32. if task.ret.is_some() {
  33. let ret = task.ret.take().unwrap();
  34. task.set_state(TaskState::Cancel);
  35. let _ = ret.send(task.into());
  36. }
  37. });
  38. }
  39. pub(crate) fn next_task_id(&self) -> TaskId {
  40. let _ = self.task_id_counter.fetch_add(1, SeqCst);
  41. self.task_id_counter.load(SeqCst)
  42. }
  43. }