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
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
|
/* This file is part of the KDE project
Copyright (C) 2003 - 2006 Dag Andersen <danders@get2net.dk>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation;
version 2 of the License.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef KPTCALENDAR_H
#define KPTCALENDAR_H
#include "kptmap.h"
#include "kptduration.h"
#include <tqdatetime.h>
#include <tqpair.h>
#include <tqptrlist.h>
class TQDomElement;
class TQDateTime;
class TQTime;
class TQDate;
class TQString;
namespace KPlato
{
class DateTime;
class Project;
class CalendarDay {
public:
CalendarDay();
CalendarDay(int state);
CalendarDay(TQDate date, int state=0);
CalendarDay(CalendarDay *day);
~CalendarDay();
bool load(TQDomElement &element);
void save(TQDomElement &element) const;
const TQPtrList<TQPair<TQTime, TQTime> > &workingIntervals() const { return m_workingIntervals; }
void addInterval(TQPair<TQTime, TQTime> *interval);
void addInterval(TQPair<TQTime, TQTime> interval) { addInterval(new TQPair<TQTime, TQTime>(interval)); }
void clearIntervals() { m_workingIntervals.clear(); }
void setIntervals(TQPtrList<TQPair<TQTime, TQTime> > intervals) {
m_workingIntervals.clear();
m_workingIntervals = intervals;
}
TQTime startOfDay() const;
TQTime endOfDay() const;
TQDate date() const { return m_date; }
void setDate(TQDate date) { m_date = date; }
int state() const { return m_state; }
void setState(int state) { m_state = state; }
bool operator==(const CalendarDay *day) const;
bool operator==(const CalendarDay &day) const;
bool operator!=(const CalendarDay *day) const;
bool operator!=(const CalendarDay &day) const;
/**
* Returns the amount of 'worktime' that can be done on
* this day between the times start and end.
*/
Duration effort(const TQTime &start, const TQTime &end);
/**
* Returns the actual 'work interval' for the interval start to end.
* If no 'work interval' exists, returns the interval start, end.
* Use @ref hasInterval() to check if a 'work interval' exists.
*/
TQPair<TQTime, TQTime> interval(const TQTime &start, const TQTime &end) const;
bool hasInterval() const;
/**
* Returns true if at least a part of a 'work interval' exists
* for the interval start to end.
*/
bool hasInterval(const TQTime &start, const TQTime &end) const;
Duration duration() const;
const CalendarDay ©(const CalendarDay &day);
private:
TQDate m_date; //NOTE: inValid if used for weekdays
int m_state;
TQPtrList<TQPair<TQTime, TQTime> > m_workingIntervals;
#ifndef NDEBUG
public:
void printDebug(TQCString indent="");
#endif
};
class CalendarWeekdays {
public:
CalendarWeekdays();
CalendarWeekdays(CalendarWeekdays *weekdays);
~CalendarWeekdays();
bool load(TQDomElement &element);
void save(TQDomElement &element) const;
void addWeekday(CalendarDay *day) { m_weekdays.append(day); }
const TQPtrList<CalendarDay> &weekdays() const { return m_weekdays; }
/**
* Returns the pointer to CalendarDay for day or 0 if not defined.
* day is 0..6.
* @param day todo : add a comment
*/
CalendarDay *weekday(int day) const;
CalendarDay *weekday(const TQDate &date) const { return weekday(date.dayOfWeek()-1); }
CalendarDay *replace(int weekday, CalendarDay *day) {
CalendarDay *d = m_weekdays.at(weekday);
m_weekdays.replace(weekday, day);
return d;
}
IntMap map();
void setWeekday(IntMap::iterator it, int state) { m_weekdays.at(it.key())->setState(state); }
int state(const TQDate &date) const;
int state(int weekday) const;
void setState(int weekday, int state);
const TQPtrList<TQPair<TQTime, TQTime> > &intervals(int weekday) const;
void setIntervals(int weekday, TQPtrList<TQPair<TQTime, TQTime> >intervals);
void clearIntervals(int weekday);
bool operator==(const CalendarWeekdays *weekdays) const;
bool operator!=(const CalendarWeekdays *weekdays) const;
Duration effort(const TQDate &date, const TQTime &start, const TQTime &end);
/**
* Returns the actual 'work interval' on the weekday defined by date
* for the interval start to end.
* If no 'work interval' exists, returns the interval start, end.
* Use @ref hasInterval() to check if a 'work interval' exists.
*/
TQPair<TQTime, TQTime> interval(const TQDate date, const TQTime &start, const TQTime &end) const;
/**
* Returns true if at least a part of a 'work interval' exists
* on the weekday defined by date for the interval start to end.
*/
bool hasInterval(const TQDate date, const TQTime &start, const TQTime &end) const;
bool hasInterval() const;
Duration duration() const;
Duration duration(int weekday) const;
/// Returns the time when the weekday starts
TQTime startOfDay(int weekday) const;
/// Returns the time when the weekday ends
TQTime endOfDay(int weekday) const;
const CalendarWeekdays ©(const CalendarWeekdays &weekdays);
private:
TQPtrList<CalendarDay> m_weekdays;
double m_workHours;
#ifndef NDEBUG
public:
void printDebug(TQCString indent="");
#endif
};
/**
* Calendar defines the working and nonworking days and hours.
* A day can have the three states None (Undefined), NonWorking, or Working.
* A calendar can have a parent calendar that defines the days that are
* undefined in this calendar. If a day is still undefined, it defaults
* to Nonworking.
* A Working day has one or more work intervals to define the work hours.
*
* The definition can consist of two parts: Weekdays and Day.
* Day has highest priority.
*
* A typical calendar hierarchy could include calendars on three levels:
* 1. Definition of normal weekdays and national holidays/vacation days.
* 2. Definition of the company's special workdays/-time and vacation days.
* 3. Definitions for groups of resources/individual resources.
*
*/
class Calendar {
public:
Calendar();
Calendar(TQString name, Calendar *parent=0);
Calendar(Calendar *calendar);
~Calendar();
TQString name() const { return m_name; }
void setName(TQString name) { m_name = name; }
Calendar *parent() const { return m_parent; }
void setParent(Calendar *parent) { m_parent = parent; }
Project *project() const { return m_project; }
void setProject(Project *project);
bool isDeleted() const { return m_deleted; }
void setDeleted(bool yes);
TQString id() const { return m_id; }
bool setId(TQString id);
void generateId();
bool load(TQDomElement &element);
void save(TQDomElement &element) const;
/**
* Find the definition for the day date.
* If skipUndefined=true the day is NOT returned if it has state None (Undefined).
*/
CalendarDay *findDay(const TQDate &date, bool skipUndefined=false) const;
bool addDay(CalendarDay *day) { return m_days.insert(0, day); }
bool removeDay(CalendarDay *day) { return m_days.removeRef(day); }
CalendarDay *takeDay(CalendarDay *day) { return m_days.take(m_days.find(day)); }
const TQPtrList<CalendarDay> &days() const { return m_days; }
/**
* Returns the state of definition for parents day date in it.
* Also checks the parents recursively.
*/
int parentDayState(const TQDate &date) const;
IntMap weekdaysMap() { return m_weekdays->map(); }
void setWeekday(IntMap::iterator it, int state) { m_weekdays->setWeekday(it, state); }
CalendarWeekdays *weekdays() { return m_weekdays; }
CalendarDay *weekday(int day) const { return m_weekdays->weekday(day); }
TQString parentId() const { return m_parentId; }
void setParentId(TQString id) { m_parentId = id; }
bool hasParent(Calendar *cal);
/**
* Returns the amount of 'worktime' that can be done on
* the date date between the times start and end.
*/
Duration effort(const TQDate &date, const TQTime &start, const TQTime &end) const;
/**
* Returns the amount of 'worktime' that can be done in the
* interval from start to end
*/
Duration effort(const DateTime &start, const DateTime &end) const;
/**
* Returns the first 'work interval' for the interval
* starting at start and ending at end.
* If no 'work interval' exists, returns an interval with invalid DateTime.
* You can also use @ref hasInterval() to check if a 'work interval' exists.
*/
TQPair<DateTime, DateTime> firstInterval(const DateTime &start, const DateTime &end) const;
/**
* Returns the first 'work interval' on date for the interval
* starting at start and ending at end.
* If no 'work interval' exists, returns an interval with first==second.
* You can also use @ref hasInterval() to check if a 'work interval' exists.
*/
TQPair<TQTime, TQTime> firstInterval(const TQDate &date, const TQTime &start, const TQTime &end) const;
/**
* Returns true if at least a part of a 'work interval' exists
* for the interval starting at start and ending at end.
*/
bool hasInterval(const DateTime &start, const DateTime &end) const;
/**
* Returns true if at least a part of a 'work interval' exists
* for the interval on date, starting at start and ending at end.
*/
bool hasInterval(const TQDate &date, const TQTime &start, const TQTime &end) const;
/**
* Find the first available time after time before limit.
* Return invalid datetime if not available.
*/
DateTime firstAvailableAfter(const DateTime &time, const DateTime &limit);
/**
* Find the first available time backwards from time. Search until limit.
* Return invalid datetime if not available.
*/
DateTime firstAvailableBefore(const DateTime &time, const DateTime &limit);
Calendar *findCalendar() const { return findCalendar(m_id); }
Calendar *findCalendar(const TQString &id) const;
bool removeId() { return removeId(m_id); }
bool removeId(const TQString &id);
void insertId(const TQString &id);
protected:
const Calendar ©(Calendar &calendar);
void init();
private:
TQString m_name;
Calendar *m_parent;
Project *m_project;
bool m_deleted;
TQString m_id;
TQString m_parentId;
TQPtrList<CalendarDay> m_days;
CalendarWeekdays *m_weekdays;
#ifndef NDEBUG
public:
void printDebug(TQCString indent="");
#endif
};
class StandardWorktime
{
public:
StandardWorktime();
StandardWorktime(StandardWorktime* worktime);
~StandardWorktime();
/// The work time of a normal year.
Duration durationYear() const { return m_year; }
/// The work time of a normal year.
double year() const { return m_year.toDouble(Duration::Unit_h); }
/// Set the work time of a normal year.
void setYear(const Duration year) { m_year = year; }
/// Set the work time of a normal year.
void setYear(double hours) { m_year = Duration((TQ_INT64)(hours*60.0*60.0)); }
/// The work time of a normal month
Duration durationMonth() const { return m_month; }
/// The work time of a normal month
double month() const { return m_month.toDouble(Duration::Unit_h); }
/// Set the work time of a normal month
void setMonth(const Duration month) { m_month = month; }
/// Set the work time of a normal month
void setMonth(double hours) { m_month = Duration((TQ_INT64)(hours*60.0*60.0)); }
/// The work time of a normal week
Duration durationWeek() const { return m_week; }
/// The work time of a normal week
double week() const { return m_week.toDouble(Duration::Unit_h); }
/// Set the work time of a normal week
void setWeek(const Duration week) { m_week = week; }
/// Set the work time of a normal week
void setWeek(double hours) { m_week = Duration((TQ_INT64)(hours*60.0*60.0)); }
/// The work time of a normal day
Duration durationDay() const { return m_day; }
/// The work time of a normal day
double day() const { return m_day.toDouble(Duration::Unit_h); }
/// Set the work time of a normal day
void setDay(const Duration day) { m_day = day; }
/// Set the work time of a normal day
void setDay(double hours) { m_day = Duration((TQ_INT64)(hours*60.0*60.0)); }
bool load(TQDomElement &element);
void save(TQDomElement &element) const;
Calendar *calendar() const { return m_calendar; }
protected:
void init();
private:
Duration m_year;
Duration m_month;
Duration m_week;
Duration m_day;
Calendar *m_calendar;
#ifndef NDEBUG
public:
void printDebug(TQCString indent="");
#endif
};
} //KPlato namespace
#endif
|