cfait 1.1.7

Powerful, fast and elegant task / TODO manager. (GUI & TUI, CalDAV & local)
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290

// SPDX-License-Identifier: GPL-3.0-or-later
// File: ./src/model/recurrence.rs
use crate::model::item::{Alarm, AlarmTrigger, DateType, RawProperty, Task, TaskStatus};
use chrono::{Datelike, Local, NaiveDate};
use rrule::RRuleSet;
use std::collections::HashSet; // Import HashSet for deduplication
use std::str::FromStr;
use uuid::Uuid;

pub struct RecurrenceEngine;

impl RecurrenceEngine {
    /// Calculates the next occurrence of a task based on its RRULE.
    /// Returns a new Task instance for the next occurrence, or None if finished.
    pub fn next_occurrence(task: &Task) -> Option<Task> {
        let rule_str = task.rrule.as_ref()?;
        let seed_date_type = task.dtstart.as_ref().or(task.due.as_ref())?;

        // 1. Establish the Local Naive seed for the recurrence engine.
        // For AllDay tasks, we use midnight (or a specific time if one exists on the other date field).
        let seed_local_naive = match seed_date_type {
            DateType::AllDay(d) => {
                let local_time = match (task.dtstart.as_ref(), task.due.as_ref()) {
                    (Some(DateType::Specific(dt)), _) => Some(dt.with_timezone(&Local).time()),
                    (_, Some(DateType::Specific(dt))) => Some(dt.with_timezone(&Local).time()),
                    _ => None,
                };
                if let Some(time) = local_time {
                    d.and_time(time)
                } else {
                    d.and_hms_opt(0, 0, 0).unwrap()
                }
            }
            DateType::Specific(dt) => dt.with_timezone(&Local).naive_local(),
            DateType::Month(y, m) => {
                let d = NaiveDate::from_ymd_opt(*y, *m, 1).unwrap();
                d.and_hms_opt(0, 0, 0).unwrap()
            }
            DateType::Year(y) => {
                let d = NaiveDate::from_ymd_opt(*y, 1, 1).unwrap();
                d.and_hms_opt(0, 0, 0).unwrap()
            }
        };

        // Construct RRULE string using Floating Time (No 'Z' suffix)
        let dtstart_str = seed_local_naive.format("%Y%m%dT%H%M%S").to_string();

        let clean_rule = rule_str.trim();
        let mut final_rule_part = if clean_rule.to_uppercase().starts_with("RRULE:") {
            clean_rule[6..].to_string()
        } else {
            clean_rule.to_string()
        };

        // Ensure UNTIL is strictly floating time (No 'Z') to match our local-naive DTSTART.
        // Rebuild the RRULE string cleanly to avoid leaving dangling TZID parameters.
        let parts: Vec<&str> = final_rule_part.split(';').collect();
        let mut new_parts = Vec::new();

        for part in parts {
            if let Some(until_val) = part.strip_prefix("UNTIL=") {
                if until_val.len() == 8 && !until_val.contains('T') {
                    new_parts.push(format!("UNTIL={}T235959", until_val));
                } else if let Some(stripped) = until_val.strip_suffix('Z') {
                    new_parts.push(format!("UNTIL={}", stripped));
                } else {
                    new_parts.push(part.to_string());
                }
            } else {
                new_parts.push(part.to_string());
            }
        }
        final_rule_part = new_parts.join(";");

        let rrule_string = format!("DTSTART:{}\nRRULE:{}\n", dtstart_str, final_rule_part);

        if let Ok(rrule_set) = RRuleSet::from_str(&rrule_string) {
            let comparison_now_local = match seed_date_type {
                DateType::AllDay(_) => Local::now().date_naive().and_hms_opt(0, 0, 0).unwrap(),
                DateType::Specific(_) => Local::now().naive_local(),
                DateType::Month(_, _) => Local::now().date_naive().and_hms_opt(0, 0, 0).unwrap(),
                DateType::Year(_) => Local::now().date_naive().and_hms_opt(0, 0, 0).unwrap(),
            };

            let search_floor_local = std::cmp::max(comparison_now_local, seed_local_naive);

            // Deduplicate and localize EXDATEs for manual filtering to completely
            // bypass the rrule crate's notoriously strict validation which crashes on
            // timezone/DST mismatches or past exceptions.
            let mut exclusion_dates = HashSet::new();
            if !task.exdates.is_empty() {
                for ex in &task.exdates {
                    let ex_date = match ex {
                        DateType::AllDay(d) => *d,
                        DateType::Specific(dt) => dt.with_timezone(&Local).naive_local().date(),
                        DateType::Month(y, m) => NaiveDate::from_ymd_opt(*y, *m, 1).unwrap(),
                        DateType::Year(y) => NaiveDate::from_ymd_opt(*y, 1, 1).unwrap(),
                    };
                    exclusion_dates.insert(ex_date);
                }
            }

            let rrule_next_naive = rrule_set
                .into_iter()
                .map(|d| d.naive_local())
                .find(|d| *d > search_floor_local && !exclusion_dates.contains(&d.date()));

            let is_simple_monthly =
                final_rule_part.contains("FREQ=MONTHLY") && !final_rule_part.contains("BY");
            let is_simple_yearly =
                final_rule_part.contains("FREQ=YEARLY") && !final_rule_part.contains("BY");

            let next_occurrence_naive = if let Some(rn) = rrule_next_naive {
                if is_simple_monthly || is_simple_yearly {
                    let interval = if let Some(idx) = final_rule_part.find("INTERVAL=") {
                        let end = final_rule_part[idx..]
                            .find(';')
                            .map(|i| idx + i)
                            .unwrap_or(final_rule_part.len());
                        final_rule_part[idx + 9..end].parse::<u32>().unwrap_or(1)
                    } else {
                        1
                    };

                    let expected_months = if is_simple_yearly {
                        interval * 12
                    } else {
                        interval
                    };

                    if let Some(expected_date) =
                        seed_local_naive.checked_add_months(chrono::Months::new(expected_months))
                    {
                        if rn > expected_date && expected_date > search_floor_local {
                            Some(expected_date)
                        } else {
                            Some(rn)
                        }
                    } else {
                        Some(rn)
                    }
                } else {
                    Some(rn)
                }
            } else {
                None
            };

            if let Some(naive_next) = next_occurrence_naive {
                // Convert back to Absolute UTC for safe storage
                let next_start =
                    crate::model::item::safe_local_to_utc(naive_next.date(), naive_next.time());

                let mut next_task = task.clone();
                next_task.uid = Uuid::new_v4().to_string();
                next_task.href = String::new();
                next_task.etag = String::new();
                next_task.status = TaskStatus::NeedsAction;
                next_task.percent_complete = None;
                next_task.dependencies.clear();
                next_task.sequence = 0;

                next_task
                    .unmapped_properties
                    .retain(|p| p.key != "COMPLETED");

                next_task
                    .alarms
                    .retain(|a: &Alarm| !a.is_snooze() && a.acknowledged.is_none());

                // Advance explicit absolute alarms along with the task
                // By applying the delta in Local Naive time, we preserve the wall-clock hour
                // perfectly across Daylight Saving Time boundaries!
                let naive_delta = naive_next - seed_local_naive;

                for alarm in &mut next_task.alarms {
                    if let AlarmTrigger::Absolute(ref mut dt) = alarm.trigger {
                        let alarm_local = dt.with_timezone(&Local).naive_local();
                        let new_alarm_local = alarm_local + naive_delta;
                        *dt = crate::model::item::safe_local_to_utc(
                            new_alarm_local.date(),
                            new_alarm_local.time(),
                        );
                    }
                }

                next_task.exdates.sort_by(|a, b| a.partial_cmp(b).unwrap());
                next_task.exdates.dedup();

                // Keep all EXDATEs to preserve cancellation history for calendar event synchronization
                // This allows other clients to see which instances were cancelled

                // Calculate duration gap in Naive time to prevent DST shifts from stretching the gap
                let duration_naive = if let Some(old_due) = &task.due {
                    match old_due {
                        DateType::AllDay(d) => {
                            let due_naive = d.and_hms_opt(0, 0, 0).unwrap();
                            due_naive - seed_local_naive
                        }
                        DateType::Specific(dt) => {
                            let due_naive = dt.with_timezone(&Local).naive_local();
                            due_naive - seed_local_naive
                        }
                        DateType::Month(y, m) => {
                            let d = NaiveDate::from_ymd_opt(*y, *m, 1).unwrap();
                            let due_naive = d.and_hms_opt(0, 0, 0).unwrap();
                            due_naive - seed_local_naive
                        }
                        DateType::Year(y) => {
                            let d = NaiveDate::from_ymd_opt(*y, 1, 1).unwrap();
                            let due_naive = d.and_hms_opt(0, 0, 0).unwrap();
                            due_naive - seed_local_naive
                        }
                    }
                } else {
                    chrono::Duration::zero()
                };

                if let Some(old_start) = &task.dtstart {
                    next_task.dtstart = match old_start {
                        DateType::AllDay(_) => Some(DateType::AllDay(naive_next.date())),
                        DateType::Specific(_) => Some(DateType::Specific(next_start)),
                        DateType::Month(_, _) => {
                            Some(DateType::Month(naive_next.year(), naive_next.month()))
                        }
                        DateType::Year(_) => Some(DateType::Year(naive_next.year())),
                    };
                }

                if let Some(old_due) = &task.due {
                    let next_due_naive = naive_next + duration_naive;
                    let next_due_utc = crate::model::item::safe_local_to_utc(
                        next_due_naive.date(),
                        next_due_naive.time(),
                    );
                    next_task.due = match old_due {
                        DateType::AllDay(_) => Some(DateType::AllDay(next_due_naive.date())),
                        DateType::Specific(_) => Some(DateType::Specific(next_due_utc)),
                        DateType::Month(_, _) => Some(DateType::Month(
                            next_due_naive.year(),
                            next_due_naive.month(),
                        )),
                        DateType::Year(_) => Some(DateType::Year(next_due_naive.year())),
                    };
                }

                return Some(next_task);
            }
        }
        None
    }

    /// Advances the task to the next recurrence instance IN PLACE.
    /// This preserves UID, HREF, and ETAG, satisfying "Recycling" logic.
    pub fn advance(task: &mut Task) -> bool {
        if let Some(next) = Self::next_occurrence(task) {
            // Capture identity
            let uid = task.uid.clone();
            let href = task.href.clone();
            let etag = task.etag.clone();
            let calendar_href = task.calendar_href.clone();
            let created_at = task
                .unmapped_properties
                .iter()
                .find(|p| p.key == "CREATED")
                .map(|p| p.value.clone());

            *task = next;

            // Restore identity
            task.uid = uid;
            task.href = href;
            task.etag = etag;
            task.calendar_href = calendar_href;

            if let Some(created_val) = created_at {
                task.unmapped_properties.retain(|p| p.key != "CREATED");
                task.unmapped_properties.push(RawProperty {
                    key: "CREATED".to_string(),
                    value: created_val,
                    params: vec![],
                });
            }

            task.sequence += 1;
            return true;
        }
        false
    }
}