Struct RosterSchedule 

pub struct RosterSchedule {

    pub course_code: String,
    pub last_fetched_at: Option<DateTime<Utc>>,
    pub last_fetch_started_at: Option<DateTime<Utc>>,
    pub last_mailing_fetch_started_at: Option<DateTime<Utc>>,
    pub last_fetch_duration_ms: Option<i32>,
    pub last_listed_person_count: Option<i32>,
    pub is_fetched_alone: bool,
    pub consecutive_failures: i32,
    pub retry_not_before: Option<DateTime<Utc>>,
    pub last_error: Option<CreditRegistrationErrorCode>,
    pub module_count: i64,
    pub waiting_count: i64,
    pub next_rung_at: Option<DateTime<Utc>>,
    pub unserved_press_at: Option<DateTime<Utc>>,
    pub fetches_today: i32,
    pub fetch_requested_at: Option<DateTime<Utc>>,
    pub linking_counters: Option<AccountLinkingCodeCounters>,
    pub unlinked_enrolled_before_count: Option<i32>,
}

One code’s schedule, with the waiting people its next fetch is derived from.

Fields

course_code: String

last_fetched_at: Option<DateTime<Utc>>

last_fetch_started_at: Option<DateTime<Utc>>

last_mailing_fetch_started_at: Option<DateTime<Utc>>

When the latest arrived fetch that could claim linking mail was sent.

last_fetch_duration_ms: Option<i32>

last_listed_person_count: Option<i32>

is_fetched_alone: bool

consecutive_failures: i32

retry_not_before: Option<DateTime<Utc>>

last_error: Option<CreditRegistrationErrorCode>

module_count: i64

The active modules on the code, which share its enrolment list.

waiting_count: i64

Registrations on the code’s modules waiting for a student number within WAITING_HORIZON of an anchor. Always zero with account linking off.

next_rung_at: Option<DateTime<Utc>>

The earliest unserved rung of a waiting person’s ladder.

unserved_press_at: Option<DateTime<Utc>>

The latest unserved “I have enrolled” press a waiting person’s ladder is anchored on.

fetches_today: i32

Fetches of the code sent today (UTC), against MAX_FETCHES_PER_DAY.

fetch_requested_at: Option<DateTime<Utc>>

An admin’s fetch request; served once a fetch sent after it arrives.

linking_counters: Option<AccountLinkingCodeCounters>

The last enrolment list that fed account linking.

unlinked_enrolled_before_count: Option<i32>

From the same list: people who enrolled before account linking began and are linked to no account, so no linking mail went to them.

Implementations

impl RosterSchedule

pub fn next_fetch_at(&self, now: DateTime<Utc>) -> DateTime<Utc>

When the code is next due, ignoring the failure backoff: at once if it has never been fetched.

fn slot_after(&self, ready_at: DateTime<Utc>, gap: TimeDelta) -> DateTime<Utc>

The first grid point at or after ready_at that is at least gap after the last fetch.

pub fn unserved_fetch_request_at(&self) -> Option<DateTime<Utc>>

An admin’s fetch request no fetch sent after it has served yet.

pub fn is_due(&self, now: DateTime<Utc>) -> bool

Whether the code is to be fetched now, failure backoff included.

Trait Implementations

impl Clone for RosterSchedule

fn clone(&self) -> RosterSchedule

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RosterSchedule

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for RosterSchedule

fn eq(&self, other: &RosterSchedule) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RosterSchedule