cfait 1.1.8

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

// SPDX-License-Identifier: GPL-3.0-or-later
//! Tests for floating time behavior in recurrence engine.
// Ensures that recurring tasks respect local wall-clock time across Daylight Saving Time boundaries.

use cfait::model::{DateType, Task};
use chrono::NaiveTime;
use std::collections::HashMap;

// Helper function to parse task
fn parse(input: &str) -> Task {
    Task::new(input, &HashMap::new(), None)
}

#[test]
fn test_floating_time_weekly_recurrence() {
    // Create a task with a weekly recurrence
    let t = parse("Take vitamins @weekly");

    // Ensure the task has a recurrence rule
    assert!(t.rrule.is_some());
    let rrule = t.rrule.clone().unwrap();
    assert!(rrule.contains("FREQ=WEEKLY"));

    // Ensure the task has a start time
    assert!(t.dtstart.is_some());

    // Calculate the next occurrence
    let next_task = cfait::model::RecurrenceEngine::next_occurrence(&t);

    // Ensure the next occurrence is calculated
    assert!(next_task.is_some());
    let next_task = next_task.unwrap();

    // Ensure the next occurrence has the same local time as the original task
    let original_time = match t.dtstart.unwrap() {
        DateType::Specific(dt) => dt.with_timezone(&chrono::Local).time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    let next_time = match next_task.dtstart.unwrap() {
        DateType::Specific(dt) => dt.with_timezone(&chrono::Local).time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    assert_eq!(original_time, next_time);
}

#[test]
fn test_floating_time_daily_recurrence() {
    // Create a task with a daily recurrence
    let t = parse("Morning walk @daily");

    // Ensure the task has a recurrence rule
    assert!(t.rrule.is_some());
    let rrule = t.rrule.clone().unwrap();
    assert!(rrule.contains("FREQ=DAILY"));

    // Ensure the task has a start time
    assert!(t.dtstart.is_some());

    // Calculate the next occurrence
    let next_task = cfait::model::RecurrenceEngine::next_occurrence(&t);

    // Ensure the next occurrence is calculated
    assert!(next_task.is_some());
    let next_task = next_task.unwrap();

    // Ensure the next occurrence has the same local time as the original task
    let original_time = match t.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    let next_time = match next_task.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    assert_eq!(original_time, next_time);
}

#[test]
fn test_floating_time_monthly_recurrence() {
    // Create a task with a monthly recurrence
    let t = parse("Pay rent @monthly");

    // Ensure the task has a recurrence rule
    assert!(t.rrule.is_some());
    let rrule = t.rrule.clone().unwrap();
    assert!(rrule.contains("FREQ=MONTHLY"));

    // Ensure the task has a start time
    assert!(t.dtstart.is_some());

    // Calculate the next occurrence
    let next_task = cfait::model::RecurrenceEngine::next_occurrence(&t);

    // Ensure the next occurrence is calculated
    assert!(next_task.is_some());
    let next_task = next_task.unwrap();

    // Ensure the next occurrence has the same local time as the original task
    let original_time = match t.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    let next_time = match next_task.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    assert_eq!(original_time, next_time);
}

#[test]
fn test_floating_time_yearly_recurrence() {
    // Create a task with a yearly recurrence
    let t = parse("Annual checkup @yearly");

    // Ensure the task has a recurrence rule
    assert!(t.rrule.is_some());
    let rrule = t.rrule.clone().unwrap();
    assert!(rrule.contains("FREQ=YEARLY"));

    // Ensure the task has a start time
    assert!(t.dtstart.is_some());

    // Calculate the next occurrence
    let next_task = cfait::model::RecurrenceEngine::next_occurrence(&t);

    // Ensure the next occurrence is calculated
    assert!(next_task.is_some());
    let next_task = next_task.unwrap();

    // Ensure the next occurrence has the same local time as the original task
    let original_time = match t.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    let next_time = match next_task.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    assert_eq!(original_time, next_time);
}

#[test]
fn test_floating_time_with_explicit_time() {
    // Create a task with a specific time and weekly recurrence
    let t = parse("Take vitamins at 11:00 @weekly");

    // Ensure the task has a recurrence rule
    assert!(t.rrule.is_some());
    let rrule = t.rrule.clone().unwrap();
    assert!(rrule.contains("FREQ=WEEKLY"));

    // Ensure the task has a start time
    assert!(t.dtstart.is_some());

    // Calculate the next occurrence
    let next_task = cfait::model::RecurrenceEngine::next_occurrence(&t);

    // Ensure the next occurrence is calculated
    assert!(next_task.is_some());
    let next_task = next_task.unwrap();

    // Ensure the next occurrence has the same local time as the original task
    let original_time = match t.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    let next_time = match next_task.dtstart.unwrap() {
        DateType::Specific(dt) => dt.time(),
        DateType::AllDay(_d) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Month(_, _) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
        DateType::Year(_) => NaiveTime::from_hms_opt(0, 0, 0).unwrap(),
    };

    assert_eq!(original_time, next_time);
}