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
|
# -*- coding: utf-8 -*-
'''
Task Coach - Your friendly task manager
Copyright (C) 2004-2014 Task Coach developers <developers@taskcoach.org>
Copyright (C) 2008 João Alexandre de Toledo <jtoledo@griffo.com.br>
Task Coach is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Task Coach is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''
from taskcoachlib.i18n import _
from taskcoachlib.domain import categorizable
from taskcoachlib import help, operating_system # pylint: disable=W0622
import task
class TaskListQueryMixin(object):
def nrOfTasksPerStatus(self):
statuses = [eachTask.status() for eachTask in self if not eachTask.isDeleted()]
count = dict()
for status in task.Task.possibleStatuses():
count[status] = statuses.count(status)
return count
class TaskList(TaskListQueryMixin, categorizable.CategorizableContainer):
# FIXME: TaskList should be called TaskCollection or TaskSet
newItemMenuText = _('&New task...') + ('\tINSERT' if not operating_system.isMac() else '\tCtrl+N')
newItemHelpText = help.taskNew
def nrBeingTracked(self):
return len(self.tasksBeingTracked())
def tasksBeingTracked(self):
return [eachTask for eachTask in self if eachTask.isBeingTracked()]
def efforts(self):
result = []
for task in self: # pylint: disable=W0621
result.extend(task.efforts())
return result
def originalLength(self):
''' Provide a way for bypassing the __len__ method of decorators. '''
return len([t for t in self if not t.isDeleted()])
def minPriority(self):
return min(self.__allPriorities())
def maxPriority(self):
return max(self.__allPriorities())
def __allPriorities(self):
return [task.priority() for task in self if not task.isDeleted()] or (0,) # pylint: disable=W0621
|
