celery 0.5.5

Rust implementation of Celery
Documentation 
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

use super::Schedule;
use crate::protocol::TryCreateMessage;
use std::{cmp::Ordering, time::SystemTime};

/// A task which is scheduled for execution. It contains the task to execute,
/// the queue where to send it and the schedule which determines when to do it.
pub struct ScheduledTask {
    pub name: String,
    pub message_factory: Box<dyn TryCreateMessage>,
    pub queue: String,
    pub schedule: Box<dyn Schedule>,
    pub total_run_count: u32,
    pub last_run_at: Option<SystemTime>,
    pub next_call_at: SystemTime,
}

impl ScheduledTask {
    /// Create a new scheduled task.
    pub fn new<S>(
        name: String,
        message_factory: Box<dyn TryCreateMessage>,
        queue: String,
        schedule: S,
        next_call_at: SystemTime,
    ) -> ScheduledTask
    where
        S: Schedule + 'static,
    {
        ScheduledTask {
            name,
            message_factory,
            queue,
            schedule: Box::new(schedule),
            total_run_count: 0,
            last_run_at: None,
            next_call_at,
        }
    }

    /// Update the `next_call_at` field of the task.
    /// If the task is not scheduled to run again, this method
    /// will return `None`.
    pub(super) fn reschedule_task(mut self) -> Option<ScheduledTask> {
        match self.schedule.next_call_at(self.last_run_at) {
            Some(next_call_at) => {
                self.next_call_at = next_call_at;
                Some(self)
            }
            None => None,
        }
    }
}

// We implement PartialEq, Eq, PartialOrd and Ord for ScheduledTask
// because we want to use it in a BinaryHeap.

impl Ord for ScheduledTask {
    fn cmp(&self, other: &Self) -> Ordering {
        // We only care about next_call_at when we are comparing different tasks.
        // The comparison order is important (other is compared to self):
        // BinaryHeap is a max-heap by default, but we want a min-heap.
        other.next_call_at.cmp(&self.next_call_at)
    }
}

impl PartialOrd for ScheduledTask {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl PartialEq for ScheduledTask {
    fn eq(&self, other: &Self) -> bool {
        other.cmp(self) == Ordering::Equal
    }
}

impl Eq for ScheduledTask {}