// Copyright: Ankitects Pty Ltd and contributors
// License: GNU AGPL, version 3 or later; http://www.gnu.org/licenses/agpl.html

use std::collections::HashMap;

use anki_proto::stats::graphs_response::FutureDue;

use super::GraphsContext;
use crate::card::CardQueue;
use crate::scheduler::timing::is_unix_epoch_timestamp;

impl GraphsContext {
    pub(super) fn future_due(&self) -> FutureDue {
        let mut have_backlog = false;
        let mut due_by_day: HashMap<i32, u32> = Default::default();
        let mut daily_load = 0.0;
        for c in &self.cards {
            if matches!(c.queue, CardQueue::New | CardQueue::Suspended) {
                continue;
            }
            let due = c.original_or_current_due();
            let due_day = if is_unix_epoch_timestamp(due) {
                let offset = due as i64 - self.next_day_start.0;
                (offset / 86_400) as i32
            } else {
                due - (self.days_elapsed as i32)
            };

            daily_load += 1.0 / c.interval.max(1) as f32;

            // still want to filtered out buried cards that are due today
            if due_day == 0 && matches!(c.queue, CardQueue::UserBuried | CardQueue::SchedBuried) {
                continue;
            }
            have_backlog |= due_day < 0;
            *due_by_day.entry(due_day).or_default() += 1;
        }
        FutureDue {
            future_due: due_by_day,
            have_backlog,
            daily_load: daily_load as u32,
        }
    }
}