Skip to content

Complete recurring task test coverage #187

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ZFordDev merged 1 commit into from
Aug 27, 2026
Merged

Complete recurring task test coverage #187

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 10 additions & 0 deletions tests/test_scheduler_recurrence.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -105,6 +105,15 @@ def test_recurrence_stops_at_end_date(scheduler, frozen_clock):
assert len(scheduler.get_tasks()) == 1


def test_non_recurring_completion_does_not_create_successor(scheduler, frozen_clock):
task = scheduler.add_task(date="2026-08-20", time="09:00", text="One time")

scheduler.complete_task(task.id)

assert [entry.id for entry in scheduler.get_tasks()] == [task.id]
assert scheduler.get_tasks()[0].completed == "true"


def test_new_occurrence_is_uncompleted_and_persisted(scheduler, frozen_clock):
task = scheduler.add_task(date="2026-08-20", time="09:00", text="Chain")
_with_recurrence(scheduler, task, "weekly")
Expand All @@ -115,6 +124,7 @@ def test_new_occurrence_is_uncompleted_and_persisted(scheduler, frozen_clock):
successor = [t for t in stored.values() if t.date == "2026-08-27"]
assert len(successor) == 1
assert successor[0].completed == ""
assert successor[0].completedAt == ""
assert successor[0].id != task.id
assert storage.list_completed_entries()[0].id == task.id

Expand Down