#!/usr/bin/env python2.7 # -*- coding: utf-8 -*- ############################################################################### # # Copyright 2006 - 2015, Paul Beckingham, Federico Hernandez. # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to deal # in the Software without restriction, including without limitation the rights # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell # copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included # in all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS # OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL # THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE # SOFTWARE. # # http://www.opensource.org/licenses/mit-license.php # ############################################################################### import sys import os import re import unittest # Ensure python finds the local simpletap module sys.path.append(os.path.dirname(os.path.abspath(__file__))) from basetest import Task, TestCase class TestRecurrenceSorting(TestCase): @classmethod def setUpClass(cls): """Executed once before any test in the class""" cls.t = Task() cls.t.config("report.asc.columns", "id,recur,description") cls.t.config("report.asc.sort", "recur+") cls.t.config("report.asc.filter", "status:pending") cls.t.config("report.desc.columns", "id,recur,description") cls.t.config("report.desc.sort", "recur-") cls.t.config("report.desc.filter", "status:pending") cls.t("add one due:tomorrow recur:daily") cls.t("add two due:tomorrow recur:weekly") cls.t("add three due:tomorrow recur:3d") def setUp(self): """Executed before each test in the class""" def test_sort_ascending(self): """Verify sorting by 'recur+' is correct""" code, out, err = self.t("asc rc.verbose:nothing") self.assertRegexpMatches(out, "4\s+P1D\s+one\s+6\s+P3D\s+three\s+5\s+P7D\s+two") def test_sort_descending(self): """Verify sorting by 'recur-' is correct""" code, out, err = self.t("desc rc.verbose:nothing") self.assertRegexpMatches(out, "5\s+P7D\s+two\s+6\s+P3D\s+three\s+4\s+P1D\s+one") class TestRecurrenceDisabled(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_reccurence_disabled(self): """ Test that recurrent tasks are not being generated when recurrence is disabled. """ self.t.config("recurrence", "no") self.t("add due:today recur:daily Recurrent task.") # Trigger GC, expect no match and therefore non-zero code self.t.runError("list") # Check that no task has been generated. code, out, err = self.t("task count") self.assertEqual("0", out.strip()) class TestRecurrenceLimit(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_recurrence_limit(self): """Verify that rc.recurrence.limit is obeyed""" self.t("add one due:tomorrow recur:weekly") code, out, err = self.t("list") self.assertEqual(out.count("one"), 1) code, out, err = self.t("list rc.recurrence.limit:4") self.assertEqual(out.count("one"), 4) class TestRecurrenceWeekdays(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_recurrence_weekdays(self): """Verify that 'recur:weekdays' skips weekends""" # Add a 'recur:weekdays' task due on a friday, which forces the next # instance to be monday, thereby skipping the weekend. self.t("add due:friday recur:weekdays one") # Get the original due date as a julian date. self.t("list") # GC/handleRecurrence code, friday, err = self.t("_get 2.due.julian") # Generate the second instance, obtain due date. self.t("list rc.recurrence.limit:2") # GC/handleRecurrence code, monday, err = self.t("_get 3.due.julian") # The due dates should be Friday and Monday, three days apart, # having skipped the weekend. self.assertEqual(int(friday.strip()) + 3, int(monday.strip())) class TestRecurrenceUntil(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_recurrence_until(self): """Verify that an 'until' date terminates recurrence""" self.t("add one due:now+1minute recur:PT1H until:now+125minutes") code, out, err = self.t("list rc.verbose:nothing") self.assertEqual(out.count("one"), 1) # All three expected tasks are shown: # - PT1M # - PT61M # - PT121M # - Nothing after PT125M self.t.faketime("+3h") code, out, err = self.t("list rc.verbose:nothing") self.assertEqual(out.count("one"), 3) # This test currently failing, probably because the 'until' is # propagated to the instances, and expires them also. This is certainly # the way it has been behaving for a while, but is not the original # intention. Perhaps it is now the de facto functionality, in which # change the 3 to a 0. self.t.faketime("+24h") code, out, err = self.t("list rc.verbose:nothing") #self.assertEqual(out.count("one"), 3) self.assertEqual(out.count("one"), 0) class TestRecurrenceTasks(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() self.t("add simple") self.t("add complex due:today recur:daily") def test_change_propagation(self): """Verify that changes (modify, delete) are propagated correctly""" # List tasks to generate child tasks. Should result in: # 1 simple # 3 complex # 4 complex code, out, err = self.t("minimal rc.verbose:nothing") self.assertRegexpMatches(out, "1\s+simple") self.assertRegexpMatches(out, "3\s+complex") self.assertRegexpMatches(out, "4\s+complex") # Modify a child task and do not propagate the change. self.t("3 modify complex2", input="n\n") code, out, err = self.t("_get 3.description") self.assertEqual("complex2\n", out) code, out, err = self.t("_get 4.description") self.assertEqual("complex\n", out) # Modify a child task and propagate the change. self.t("3 modify complex3", input="y\n") code, out, err = self.t("_get 3.description") self.assertEqual("complex3\n", out) code, out, err = self.t("_get 4.description") self.assertEqual("complex3\n", out) # Delete a child task, do not propagate. code, out, err = self.t("3 delete", input="n\n") self.assertIn("Deleted 1 task.", out) # Delete a child task, propagate. self.t("minimal") code, out, err = self.t("3 delete", input="y\n") self.assertIn("Deleted 1 task.", out) # Check for duplicate UUIDs. code, out, err = self.t("diag") self.assertIn("No duplicates found", out) class TestBug972(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_interpretation_of_seven(self): """Bug 972: A recurrence period of "7" is interpreted as "7s", not "7d" as intended. """ code, out, err = self.t.runError("add one due:now recur:2") self.assertIn("The duration value '2' is not supported.", err) class TestDeletionRecurrence(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_delete_parent(self): """Delete a parent with child tasks""" self.t("add one due:eom recur:daily") self.t("list") # GC/handleRecurrence code, out, err = self.t("1 delete", input="y\n") self.assertIn("Deleted 2 tasks.", out) code, out, err = self.t.runError("list") self.assertIn("No matches.", err) def test_delete_child_with_siblings(self): """Delete a child with sibling tasks""" self.t("add one due:eom recur:daily") self.t("list rc.recurrence.limit:5") code, out, err = self.t("list rc.verbose:nothing") # GC/handleRecurrence self.assertEqual(out.count("one"), 5) code, out, err = self.t("2 delete", input="y\n") self.assertIn("Deleted 5 tasks.", out) class TestAppendPrependRecurrence(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_append_propagate(self): """Append and propagate""" self.t("add one due:eom recur:daily") self.t("list rc.recurrence.limit:2") # GC/handleRecurrence code, out, err = self.t("2 append APP", input="y\n") self.assertIn("Appended 2 tasks.", out) def test_prepend_propagate(self): """Prepend and propagate""" self.t("add one due:eom recur:daily") self.t("list rc.recurrence.limit:2") # GC/handleRecurrence code, out, err = self.t("2 prepend PRE", input="y\n") self.assertIn("Prepended 2 tasks.", out) class TestNoDueDate(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() def test_no_due_date(self): """Look for an error when adding a recurring task with no due date""" code, out, err = self.t.runError("add foo recur:daily") self.assertIn("A recurring task must also have a 'due' date.", err) class TestBug932(TestCase): def setUp(self): """Executed before each test in the class""" self.t = Task() self.t.config("report.id_pri_proj.columns", "id,priority,project") self.t.config("report.id_pri_proj.labels", "ID,P,Proj") def test_modify_due_propagate(self): """Verify due date modifications propagate""" # add a recurring task with multiple child tasks # - modify a child task and test for propagation # - modify the parent task and test for propagation self.t("add R due:yesterday recur:daily") self.t("list") # GC/handleRecurrence self.t("2 modify project:P", input="y\n") code, out, err = self.t("id_pri_proj") self.assertIn("2 P", out) self.assertIn("3 P", out) self.assertIn("4 P", out) self.t("1 modify priority:H", input="y\n") code, out, err = self.t("id_pri_proj") self.assertIn("2 H P", out) self.assertIn("3 H P", out) self.assertIn("4 H P", out) class TestBug955(TestCase): def setUp(self): self.t = Task() @unittest.expectedFailure def test_no_prompt_for_parent_on_child_delete(self): """Deleting a child of a recurring task doesn't prompt for parent deletion Previously bug.955.t """ self.t("add foo due:now recur:1day") code, out, err = self.t("ls") self.assertRegexpMatches(out, re.compile("^2 tasks", re.MULTILINE)) # NOTE: Test fails here due to some strange handling of STDIN in task # "y\nn\n" actually behaves as "y\ny\n" so both tasks are deleted # in the shell 'printf "y\nn\n" | task 2 delete' works as expected. # Yet replacing the task binary with something like "hexdump", all # bytes received via STDIN are identical in python vs shell. # NOTE: This may be related to delete.t test_delete_bulk_prompt_loop code, out, err = self.t("2 delete", input="y\nn\n") self.assertIn("Deleting task 2", out) self.assertIn("Deleted 1 task", out) code, out, err = self.t("ls") self.assertRegexpMatches(out, re.compile("^1 task", re.MULTILINE)) code, out, err = self.t("2 delete", input="y\ny\n") self.assertIn("Deleting task 2", out) self.assertIn("Deleted 1 task", out) code, out, err = self.t.runError("all status:recurring") self.assertIn("No matches", err) code, out, err = self.t.runError("ls") self.assertIn("No matches", err) # TODO Wait a recurring task # TODO Upgrade a task to a recurring task # TODO Upgrade a task to a recurring task, but omit the due date (error handling) # TODO Downgrade a recurring task to a regular task # TODO Duplicate a recurring child task # TODO Duplicate a recurring parent task if __name__ == "__main__": from simpletap import TAPTestRunner unittest.main(testRunner=TAPTestRunner()) # vim: ai sts=4 et sw=4