| 1 |
/* |
| 2 |
* Shift.cpp - TaskJuggler |
| 3 |
* |
| 4 |
* SPDX-FileCopyrightText: 2001, 2002, 2003, 2004 Chris Schlaeger <[email protected]> |
| 5 |
* SPDX-FileCopyrightText: 2011 Dag Andersen <[email protected]> |
| 6 |
* SPDX-FileCopyrightText: 2016 Dag Andersen <[email protected]> |
| 7 |
* |
| 8 |
* This program is free software; you can redistribute it and/or modify |
| 9 |
* it under the terms of version 2 of the GNU General Public License as |
| 10 |
* published by the Free Software Foundation. |
| 11 |
* |
| 12 |
* $Id$ |
| 13 |
*/ |
| 14 |
|
| 15 |
// clazy:excludeall=qstring-arg |
| 16 |
#include "Shift.h" |
| 17 |
#include "Project.h" |
| 18 |
#include "debug.h" |
| 19 |
|
| 20 |
namespace TJ |
| 21 |
{ |
| 22 |
|
| 23 |
Shift::Shift(Project* prj, const QString& i, const QString& n, Shift* p, |
| 24 |
const QString& df, uint dl) : |
| 25 |
CoreAttributes(prj, i, n, p, df, dl), |
| 26 |
workingHours() |
| 27 |
{ |
| 28 |
prj->addShift(this); |
| 29 |
|
| 30 |
for (int i = 0; i < 7; i++) |
| 31 |
{ |
| 32 |
workingHours[i] = new QList<Interval*>(); |
| 33 |
// workingHours[i]->setAutoDelete(true); |
| 34 |
} |
| 35 |
} |
| 36 |
|
| 37 |
Shift::~Shift() |
| 38 |
{ |
| 39 |
for (int i = 0; i < 7; i++) |
| 40 |
delete workingHours[i]; |
| 41 |
project->deleteShift(this); |
| 42 |
} |
| 43 |
|
| 44 |
void |
| 45 |
Shift::inheritValues() |
| 46 |
{ |
| 47 |
Shift* p = (Shift*) parent; |
| 48 |
|
| 49 |
if (p) |
| 50 |
{ |
| 51 |
// Inherit start values from parent resource. |
| 52 |
for (int i = 0; i < 7; i++) |
| 53 |
{ |
| 54 |
while (!workingHours[i]->isEmpty()) delete workingHours[i]->takeFirst(); |
| 55 |
delete workingHours[i]; |
| 56 |
workingHours[i] = new QList<Interval*>(); |
| 57 |
// workingHours[i]->setAutoDelete(true); |
| 58 |
for (QListIterator<Interval*> ivi(*(p->workingHours[i])); ivi.hasNext();) |
| 59 |
workingHours[i]->append(new Interval(*ivi.next())); |
| 60 |
} |
| 61 |
} |
| 62 |
else |
| 63 |
{ |
| 64 |
// Inherit start values from project defaults. |
| 65 |
for (int i = 0; i < 7; i++) |
| 66 |
{ |
| 67 |
while (!workingHours[i]->isEmpty()) delete workingHours[i]->takeFirst(); |
| 68 |
delete workingHours[i]; |
| 69 |
workingHours[i] = new QList<Interval*>(); |
| 70 |
// workingHours[i]->setAutoDelete(true); |
| 71 |
for (QListIterator<Interval*> |
| 72 |
ivi(project->getWorkingHoursIterator(i)); ivi.hasNext();) |
| 73 |
workingHours[i]->append(new Interval(*ivi.next())); |
| 74 |
} |
| 75 |
} |
| 76 |
} |
| 77 |
|
| 78 |
void |
| 79 |
Shift::setWorkingHours(int day, const QList<Interval*>& l) |
| 80 |
{ |
| 81 |
while (!workingHours[day]->isEmpty()) delete workingHours[day]->takeFirst(); |
| 82 |
delete workingHours[day]; |
| 83 |
|
| 84 |
// Create a deep copy of the interval list. |
| 85 |
workingHours[day] = new QList<Interval*>; |
| 86 |
// workingHours[day]->setAutoDelete(true); |
| 87 |
for (QListIterator<Interval*> pli(l); pli.hasNext();) |
| 88 |
workingHours[day]->append(new Interval(*(pli.next()))); |
| 89 |
} |
| 90 |
|
| 91 |
ShiftListIterator |
| 92 |
Shift::getSubListIterator() const |
| 93 |
{ |
| 94 |
return ShiftListIterator(*sub); |
| 95 |
} |
| 96 |
|
| 97 |
bool |
| 98 |
Shift::isOnShift(const Interval& iv) const |
| 99 |
{ |
| 100 |
// Hacky way to enable handling working hours specified in timezone different from local time |
| 101 |
if (!workingIntervals.isEmpty()) { |
| 102 |
if (iv.getStart() >= workingIntervals.last().getEnd()) { |
| 103 |
return false; |
| 104 |
} |
| 105 |
for (const Interval &i : std::as_const(workingIntervals)) { |
| 106 |
if (iv.getEnd() <= i.getStart()) { |
| 107 |
return false; |
| 108 |
} |
| 109 |
if (iv.overlaps(i)) { |
| 110 |
return true; |
| 111 |
} |
| 112 |
} |
| 113 |
return false; |
| 114 |
} |
| 115 |
int dow = dayOfWeek(iv.getStart(), false); |
| 116 |
int ivStart = secondsOfDay(iv.getStart()); |
| 117 |
int ivEnd = secondsOfDay(iv.getEnd()); |
| 118 |
Interval dayIv(ivStart, ivEnd); |
| 119 |
for (QListIterator<Interval*> ili(*(workingHours[dow])); ili.hasNext();) |
| 120 |
if (ili.next()->contains(dayIv)) |
| 121 |
return true; |
| 122 |
|
| 123 |
return false; |
| 124 |
} |
| 125 |
|
| 126 |
bool |
| 127 |
Shift::isVacationDay(time_t day) const |
| 128 |
{ |
| 129 |
return workingHours[dayOfWeek(day, false)]->isEmpty(); |
| 130 |
} |
| 131 |
|
| 132 |
void |
| 133 |
Shift::addWorkingInterval(const Interval &interval) |
| 134 |
{ |
| 135 |
workingIntervals.append(interval); |
| 136 |
} |
| 137 |
|
| 138 |
QList<Interval> |
| 139 |
Shift::getWorkingIntervals() const |
| 140 |
{ |
| 141 |
return workingIntervals; |
| 142 |
} |
| 143 |
|
| 144 |
} // namespace TJ |
| 145 |
|
| 146 |
QDebug operator<<(QDebug dbg, const TJ::Shift &s) |
| 147 |
{ |
| 148 |
return dbg << &s; |
| 149 |
} |
| 150 |
QDebug operator<<(QDebug dbg, const TJ::Shift *s) |
| 151 |
{ |
| 152 |
dbg << "Shift["; |
| 153 |
if (s) dbg << s->getWorkingIntervals(); |
| 154 |
else dbg << (void*)s; |
| 155 |
return dbg << ']'; |
| 156 |
} |